./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.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-2.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 c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:31:05,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:31:05,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:31:05,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:31:05,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:31:05,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:31:05,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:31:05,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:31:05,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:31:05,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:31:05,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:31:05,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:31:05,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:31:05,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:31:05,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:31:05,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:31:05,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:31:05,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:31:05,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:31:05,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:31:05,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:31:05,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:31:05,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:31:05,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:31:05,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:31:05,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:31:05,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:31:05,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:31:05,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:31:05,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:31:05,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:31:05,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:31:05,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:31:05,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:31:05,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:31:05,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:31:05,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:31:05,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:31:05,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:31:05,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:31:05,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:31:05,753 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:05,783 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:31:05,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:31:05,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:31:05,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:31:05,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:31:05,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:31:05,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:31:05,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:31:05,787 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:31:05,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:31:05,788 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:31:05,788 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:31:05,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:31:05,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:31:05,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:31:05,789 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:31:05,789 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:31:05,789 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:31:05,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:31:05,790 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:31:05,790 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:31:05,790 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:31:05,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:31:05,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:31:05,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:31:05,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:31:05,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:31:05,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:31:05,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:31:05,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:31:05,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:31:05,792 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:31:05,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:31:05,793 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:31:05,793 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2023-02-15 22:31:06,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:31:06,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:31:06,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:31:06,096 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:31:06,097 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:31:06,098 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-2.i [2023-02-15 22:31:07,433 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:31:07,737 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:31:07,738 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2023-02-15 22:31:07,756 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e58d774/cf8d5f2409d44ea38e30ed25e73d9e0b/FLAGb0da4a572 [2023-02-15 22:31:07,775 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e58d774/cf8d5f2409d44ea38e30ed25e73d9e0b [2023-02-15 22:31:07,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:31:07,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:31:07,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:31:07,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:31:07,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:31:07,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:07" (1/1) ... [2023-02-15 22:31:07,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b77c247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:07, skipping insertion in model container [2023-02-15 22:31:07,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:07" (1/1) ... [2023-02-15 22:31:07,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:31:07,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:31:08,083 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-2.i[24092,24105] [2023-02-15 22:31:08,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:31:08,104 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:31:08,159 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-2.i[24092,24105] [2023-02-15 22:31:08,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:31:08,187 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:31:08,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:08 WrapperNode [2023-02-15 22:31:08,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:31:08,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:31:08,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:31:08,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:31:08,195 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:08" (1/1) ... [2023-02-15 22:31:08,207 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:08" (1/1) ... [2023-02-15 22:31:08,225 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2023-02-15 22:31:08,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:31:08,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:31:08,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:31:08,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:31:08,234 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:08" (1/1) ... [2023-02-15 22:31:08,234 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:08" (1/1) ... [2023-02-15 22:31:08,237 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:08" (1/1) ... [2023-02-15 22:31:08,238 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:08" (1/1) ... [2023-02-15 22:31:08,244 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:08" (1/1) ... [2023-02-15 22:31:08,248 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:08" (1/1) ... [2023-02-15 22:31:08,250 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:08" (1/1) ... [2023-02-15 22:31:08,251 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:08" (1/1) ... [2023-02-15 22:31:08,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:31:08,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:31:08,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:31:08,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:31:08,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:08" (1/1) ... [2023-02-15 22:31:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:31:08,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:08,296 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:08,301 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:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 22:31:08,332 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 22:31:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:31:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:31:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:31:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:31:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:31:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:31:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:31:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:31:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:31:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:31:08,446 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:31:08,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:31:08,494 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 22:31:08,697 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:31:08,704 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:31:08,704 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 22:31:08,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:08 BoogieIcfgContainer [2023-02-15 22:31:08,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:31:08,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:31:08,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:31:08,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:31:08,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:31:07" (1/3) ... [2023-02-15 22:31:08,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dab9ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:08, skipping insertion in model container [2023-02-15 22:31:08,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:08" (2/3) ... [2023-02-15 22:31:08,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dab9ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:08, skipping insertion in model container [2023-02-15 22:31:08,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:08" (3/3) ... [2023-02-15 22:31:08,723 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2023-02-15 22:31:08,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:31:08,742 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-02-15 22:31:08,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:31:08,804 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;@3bcf28b2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:31:08,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-02-15 22:31:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 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:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:31:08,815 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:08,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:31:08,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-15 22:31:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:08,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115958122] [2023-02-15 22:31:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:08,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:09,084 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:09,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:09,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115958122] [2023-02-15 22:31:09,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115958122] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:09,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:09,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:31:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325167417] [2023-02-15 22:31:09,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:09,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:09,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:09,152 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 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:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:09,253 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2023-02-15 22:31:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:09,258 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:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:09,266 INFO L225 Difference]: With dead ends: 76 [2023-02-15 22:31:09,266 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 22:31:09,268 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:09,272 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:09,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 22:31:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2023-02-15 22:31:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 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,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2023-02-15 22:31:09,307 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2023-02-15 22:31:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:09,307 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2023-02-15 22:31:09,307 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:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2023-02-15 22:31:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:31:09,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:09,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:31:09,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:31:09,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-15 22:31:09,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:09,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34659587] [2023-02-15 22:31:09,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:09,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:09,439 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:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34659587] [2023-02-15 22:31:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34659587] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:09,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:09,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:31:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630146277] [2023-02-15 22:31:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:09,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:09,449 INFO L87 Difference]: Start difference. First operand 54 states and 57 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:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:09,515 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2023-02-15 22:31:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:09,516 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:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:09,517 INFO L225 Difference]: With dead ends: 51 [2023-02-15 22:31:09,518 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 22:31:09,518 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:09,521 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 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:09,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 34 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:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 22:31:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-15 22:31:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.6875) internal successors, (54), 50 states have internal predecessors, (54), 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,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2023-02-15 22:31:09,527 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2023-02-15 22:31:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:09,527 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2023-02-15 22:31:09,528 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:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2023-02-15 22:31:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:31:09,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:09,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:09,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:31:09,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-02-15 22:31:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:09,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644428850] [2023-02-15 22:31:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:09,647 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:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:09,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644428850] [2023-02-15 22:31:09,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644428850] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:09,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:09,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:31:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814695140] [2023-02-15 22:31:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:09,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:09,651 INFO L87 Difference]: Start difference. First operand 51 states and 54 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:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:09,730 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2023-02-15 22:31:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:09,730 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:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:09,731 INFO L225 Difference]: With dead ends: 82 [2023-02-15 22:31:09,731 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 22:31:09,732 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:09,733 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:09,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 22:31:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2023-02-15 22:31:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 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,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-02-15 22:31:09,739 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2023-02-15 22:31:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:09,739 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-02-15 22:31:09,739 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:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-02-15 22:31:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:31:09,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:09,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:09,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:31:09,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:09,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-02-15 22:31:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:09,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811222216] [2023-02-15 22:31:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:09,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:09,859 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:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:09,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811222216] [2023-02-15 22:31:09,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811222216] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:09,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:09,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:31:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172107255] [2023-02-15 22:31:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:09,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:09,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:09,864 INFO L87 Difference]: Start difference. First operand 49 states and 52 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:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:09,935 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2023-02-15 22:31:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:09,936 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:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:09,942 INFO L225 Difference]: With dead ends: 84 [2023-02-15 22:31:09,943 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 22:31:09,943 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:09,945 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 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:09,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 104 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:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 22:31:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2023-02-15 22:31:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 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,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2023-02-15 22:31:09,963 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2023-02-15 22:31:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:09,963 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2023-02-15 22:31:09,964 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:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2023-02-15 22:31:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:31:09,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:09,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:09,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:31:09,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-02-15 22:31:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:09,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105833726] [2023-02-15 22:31:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:10,059 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:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:10,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105833726] [2023-02-15 22:31:10,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105833726] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:10,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:10,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:31:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545250634] [2023-02-15 22:31:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:10,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:31:10,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:31:10,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:31:10,064 INFO L87 Difference]: Start difference. First operand 47 states and 50 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:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:10,074 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-02-15 22:31:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:31:10,075 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:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:10,076 INFO L225 Difference]: With dead ends: 52 [2023-02-15 22:31:10,076 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 22:31:10,077 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:10,080 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 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:10,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 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:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 22:31:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2023-02-15 22:31:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 47 states have internal predecessors, (51), 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:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2023-02-15 22:31:10,092 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 11 [2023-02-15 22:31:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:10,092 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2023-02-15 22:31:10,092 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:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2023-02-15 22:31:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:31:10,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:10,096 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:10,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:31:10,097 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-02-15 22:31:10,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:10,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498756084] [2023-02-15 22:31:10,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:10,228 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:10,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:10,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498756084] [2023-02-15 22:31:10,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498756084] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:10,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436951131] [2023-02-15 22:31:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:10,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:10,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:10,241 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:10,265 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:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:10,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:31:10,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:10,435 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:10,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:10,487 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:10,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436951131] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:10,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:10,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 22:31:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493261881] [2023-02-15 22:31:10,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:10,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:31:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:31:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:31:10,491 INFO L87 Difference]: Start difference. First operand 48 states and 51 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:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:10,518 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-15 22:31:10,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:31:10,518 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:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:10,520 INFO L225 Difference]: With dead ends: 63 [2023-02-15 22:31:10,520 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 22:31:10,520 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:10,523 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:10,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:31:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 22:31:10,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-15 22:31:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 62 states have internal predecessors, (66), 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:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-02-15 22:31:10,542 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 16 [2023-02-15 22:31:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:10,542 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-02-15 22:31:10,543 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:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-02-15 22:31:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:31:10,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:10,544 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:10,551 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:10,750 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:10,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:10,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-02-15 22:31:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:10,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900606942] [2023-02-15 22:31:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:10,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:10,915 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:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:10,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900606942] [2023-02-15 22:31:10,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900606942] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:10,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:10,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:31:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586729010] [2023-02-15 22:31:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:10,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:31:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:31:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:31:10,918 INFO L87 Difference]: Start difference. First operand 63 states and 66 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:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:11,048 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2023-02-15 22:31:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:31:11,065 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:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:11,066 INFO L225 Difference]: With dead ends: 75 [2023-02-15 22:31:11,066 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 22:31:11,066 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:11,067 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:11,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 22:31:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2023-02-15 22:31:11,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 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:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-02-15 22:31:11,070 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2023-02-15 22:31:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:11,070 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-02-15 22:31:11,071 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:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-02-15 22:31:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:31:11,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:11,071 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:11,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:31:11,072 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-02-15 22:31:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:11,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931014399] [2023-02-15 22:31:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:11,335 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:11,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:11,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931014399] [2023-02-15 22:31:11,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931014399] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:31:11,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:31:11,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:31:11,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223309306] [2023-02-15 22:31:11,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:31:11,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:31:11,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:11,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:31:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:31:11,338 INFO L87 Difference]: Start difference. First operand 60 states and 64 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:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:11,454 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-02-15 22:31:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:31:11,454 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:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:11,455 INFO L225 Difference]: With dead ends: 66 [2023-02-15 22:31:11,455 INFO L226 Difference]: Without dead ends: 66 [2023-02-15 22:31:11,455 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:11,456 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:11,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 47 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:31:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-15 22:31:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2023-02-15 22:31:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 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:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-02-15 22:31:11,459 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2023-02-15 22:31:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:11,460 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-02-15 22:31:11,460 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:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-02-15 22:31:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:31:11,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:11,461 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:11,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:31:11,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 142544431, now seen corresponding path program 1 times [2023-02-15 22:31:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:11,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231443126] [2023-02-15 22:31:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:12,183 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:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:12,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231443126] [2023-02-15 22:31:12,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231443126] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:12,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419140523] [2023-02-15 22:31:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:12,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:12,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:12,189 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:12,193 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:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:12,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 22:31:12,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:12,526 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:12,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:12,599 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:12,666 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:12,683 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:12,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:12,994 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:12,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419140523] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:12,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:12,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 22:31:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901216225] [2023-02-15 22:31:12,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:12,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 22:31:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 22:31:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:31:12,998 INFO L87 Difference]: Start difference. First operand 63 states and 67 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:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:13,300 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-15 22:31:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:31:13,301 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:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:13,301 INFO L225 Difference]: With dead ends: 63 [2023-02-15 22:31:13,302 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 22:31:13,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2023-02-15 22:31:13,303 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:13,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 325 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:31:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 22:31:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-15 22:31:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 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:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-02-15 22:31:13,305 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2023-02-15 22:31:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:13,306 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-02-15 22:31:13,306 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:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-02-15 22:31:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:31:13,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:13,307 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:13,317 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:13,507 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:13,508 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-02-15 22:31:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:13,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240790154] [2023-02-15 22:31:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:13,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:14,255 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:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240790154] [2023-02-15 22:31:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240790154] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374888369] [2023-02-15 22:31:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:14,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:14,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:14,258 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:14,280 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:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:14,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 22:31:14,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:14,423 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:14,453 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:31:14,454 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:14,479 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:14,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:14,497 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:14,554 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:14,554 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:14,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:14,771 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:14,771 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:14,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:14,787 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:14,810 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,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:15,051 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:15,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374888369] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:15,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:15,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 25 [2023-02-15 22:31:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900897774] [2023-02-15 22:31:15,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:15,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:31:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:15,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:31:15,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:31:15,055 INFO L87 Difference]: Start difference. First operand 63 states and 66 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:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:16,049 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2023-02-15 22:31:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:31:16,050 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:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:16,050 INFO L225 Difference]: With dead ends: 98 [2023-02-15 22:31:16,050 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 22:31:16,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=377, Invalid=1345, Unknown=0, NotChecked=0, Total=1722 [2023-02-15 22:31:16,052 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 377 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:16,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 205 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:31:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 22:31:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2023-02-15 22:31:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 67 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:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-02-15 22:31:16,055 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 37 [2023-02-15 22:31:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:16,055 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-02-15 22:31:16,055 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:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-02-15 22:31:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:31:16,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:16,056 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:16,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 22:31:16,269 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:16,270 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-02-15 22:31:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:16,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768206816] [2023-02-15 22:31:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:17,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:17,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768206816] [2023-02-15 22:31:17,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768206816] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:17,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004119615] [2023-02-15 22:31:17,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:17,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:17,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:17,288 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:17,310 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:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:17,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-15 22:31:17,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:17,459 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:17,505 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:31:17,506 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:17,559 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,569 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,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:17,612 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,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:17,622 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:17,710 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:17,710 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:17,721 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:31:17,722 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,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:17,961 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:17,961 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:17,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:17,972 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:17,972 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:17,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:17,997 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:18,007 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:18,007 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:18,065 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:18,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:18,771 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:18,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004119615] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:18,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:18,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 30 [2023-02-15 22:31:18,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29553663] [2023-02-15 22:31:18,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:18,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 22:31:18,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:18,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 22:31:18,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2023-02-15 22:31:18,774 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 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:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:20,556 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2023-02-15 22:31:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:31:20,556 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 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:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:20,557 INFO L225 Difference]: With dead ends: 111 [2023-02-15 22:31:20,557 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 22:31:20,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=537, Invalid=1719, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 22:31:20,558 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1039 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:20,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 202 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:31:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 22:31:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 74. [2023-02-15 22:31:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) internal successors, (80), 73 states have internal predecessors, (80), 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:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-02-15 22:31:20,561 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 37 [2023-02-15 22:31:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:20,562 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-02-15 22:31:20,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 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:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-02-15 22:31:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:31:20,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:20,563 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:20,570 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:20,763 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:20,763 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash -494379329, now seen corresponding path program 1 times [2023-02-15 22:31:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:20,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332535441] [2023-02-15 22:31:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:22,221 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:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:22,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332535441] [2023-02-15 22:31:22,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332535441] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:22,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138237165] [2023-02-15 22:31:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:22,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:22,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:22,223 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:22,225 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:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:22,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 22:31:22,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:22,553 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:22,680 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:22,692 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:22,693 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:22,699 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:22,709 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:22,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:22,770 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:22,784 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:22,785 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:22,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:22,803 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:22,893 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:22,893 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:22,907 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:31:22,908 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:22,917 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:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:23,218 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:23,218 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:23,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:23,229 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:23,229 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:23,239 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:23,240 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:23,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:23,278 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:23,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:23,286 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:23,421 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:23,450 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:23,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:24,102 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:25,145 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:26,069 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:26,549 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:26,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:26,738 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:26,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:26,744 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:26,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:26,751 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:26,757 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:26,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:26,798 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:26,832 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,832 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:26,838 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,839 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:26,844 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,844 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:26,850 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,850 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:26,856 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,856 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:26,862 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,863 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:26,868 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 22:31:26,876 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,876 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:26,883 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,884 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:26,889 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,890 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:26,895 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,896 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:26,903 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:26,903 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:26,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:26,911 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:26,914 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:26,920 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:31:26,921 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:26,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:26,926 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:26,931 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:26,935 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:26,940 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:26,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:26,957 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:26,960 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:26,967 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:31:26,967 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:26,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:26,975 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:26,983 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:26,993 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:27,000 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:27,093 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:31:27,094 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:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 15 not checked. [2023-02-15 22:31:27,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138237165] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:27,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:27,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 47 [2023-02-15 22:31:27,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89350612] [2023-02-15 22:31:27,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:27,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 22:31:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:27,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 22:31:27,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1662, Unknown=23, NotChecked=340, Total=2162 [2023-02-15 22:31:27,240 INFO L87 Difference]: Start difference. First operand 74 states and 80 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:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:35,442 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2023-02-15 22:31:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:31:35,443 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:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:35,444 INFO L225 Difference]: With dead ends: 92 [2023-02-15 22:31:35,444 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 22:31:35,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=617, Invalid=3536, Unknown=23, NotChecked=516, Total=4692 [2023-02-15 22:31:35,445 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 385 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 33 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:35,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 304 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 987 Invalid, 17 Unknown, 269 Unchecked, 1.1s Time] [2023-02-15 22:31:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 22:31:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2023-02-15 22:31:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.234375) internal successors, (79), 73 states have internal predecessors, (79), 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:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-15 22:31:35,448 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 39 [2023-02-15 22:31:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:35,448 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-15 22:31:35,448 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:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-15 22:31:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:31:35,449 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:35,449 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:35,459 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:35,655 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:35,655 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999400, now seen corresponding path program 1 times [2023-02-15 22:31:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:35,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881436784] [2023-02-15 22:31:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:35,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:36,233 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:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:36,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881436784] [2023-02-15 22:31:36,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881436784] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:36,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143818292] [2023-02-15 22:31:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:36,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:36,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:36,237 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:36,266 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:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:36,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-15 22:31:36,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:36,404 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:36,423 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:36,423 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:36,437 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:31:36,438 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 14 [2023-02-15 22:31:36,457 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:36,458 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:36,536 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 22:31:36,537 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:36,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:36,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:36,624 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-02-15 22:31:36,684 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 32 treesize of output 30 [2023-02-15 22:31:36,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-02-15 22:31:36,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:36,864 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:36,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:36,872 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:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:36,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:37,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:31:37,101 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:37,103 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:37,108 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:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:31:37,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143818292] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:37,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:37,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 36 [2023-02-15 22:31:37,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946851531] [2023-02-15 22:31:37,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:37,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 22:31:37,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:37,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 22:31:37,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1118, Unknown=1, NotChecked=0, Total=1260 [2023-02-15 22:31:37,358 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 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:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:38,150 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2023-02-15 22:31:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 22:31:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 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:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:38,151 INFO L225 Difference]: With dead ends: 83 [2023-02-15 22:31:38,151 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 22:31:38,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=493, Invalid=2056, Unknown=1, NotChecked=0, Total=2550 [2023-02-15 22:31:38,153 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 242 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:38,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 276 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:31:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 22:31:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2023-02-15 22:31:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 67 states have internal predecessors, (71), 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:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2023-02-15 22:31:38,155 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2023-02-15 22:31:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:38,155 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2023-02-15 22:31:38,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 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:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2023-02-15 22:31:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:31:38,156 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:38,156 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:38,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:38,365 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:38,365 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:31:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-02-15 22:31:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:38,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818615925] [2023-02-15 22:31:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:40,143 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:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:40,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818615925] [2023-02-15 22:31:40,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818615925] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:40,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425750738] [2023-02-15 22:31:40,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:31:40,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:40,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:40,149 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:40,152 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:40,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:31:40,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:31:40,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 102 conjunts are in the unsatisfiable core [2023-02-15 22:31:40,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:40,320 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:40,376 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:40,376 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:40,434 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:40,441 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:40,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:40,487 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:40,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:40,493 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:40,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:31:40,613 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:31:40,614 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:40,697 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:31:40,698 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:40,708 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 22:31:40,709 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:40,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:40,827 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:40,828 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:40,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:40,849 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:31:40,850 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:41,031 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 22:31:41,032 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:41,051 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:31:41,051 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:41,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:41,800 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 22:31:41,800 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:41,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:41,810 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 22:31:41,811 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:42,407 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:42,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:42,535 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 22:31:42,535 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:42,565 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2023-02-15 22:31:42,566 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 83 treesize of output 80 [2023-02-15 22:31:42,645 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:42,663 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-15 22:31:42,663 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:42,693 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 22:31:42,694 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:42,838 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:42,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:44,106 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:45,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:45,501 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:45,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:45,924 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:45,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425750738] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:31:45,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:31:45,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 53 [2023-02-15 22:31:45,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243386207] [2023-02-15 22:31:45,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:45,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 22:31:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:45,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 22:31:45,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 22:31:45,928 INFO L87 Difference]: Start difference. First operand 68 states and 71 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:32:37,690 WARN L233 SmtUtils]: Spent 35.29s on a formula simplification. DAG size of input: 240 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:32:40,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:32:43,546 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse4 (select .cse16 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse5 (= .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse35 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (.cse22 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse23 (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|)) (.cse14 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse24 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse21 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) (.cse12 (select .cse23 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse25 (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse2 (select .cse22 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse8 (= .cse35 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse9 (not .cse5)) (.cse6 (= (select |c_#valid| .cse35) 1)) (.cse7 (not (= .cse4 .cse35))) (.cse17 (select .cse16 0)) (.cse34 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 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 (and (exists ((v_arrayElimCell_81 Int)) (and (= (select |c_#valid| v_arrayElimCell_81) 1) (not (= .cse4 v_arrayElimCell_81)))) .cse5) (and .cse6 .cse7) (and .cse8 .cse9)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (or .cse0 (let ((.cse11 (= .cse12 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (let ((.cse10 (select (select |c_#memory_$Pointer$.base| .cse12) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse10) 1) .cse11)) (or (= (select (select |c_#memory_$Pointer$.offset| .cse12) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse11)))) (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 .cse13 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse14) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= .cse15 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse15) 1) .cse14)))) (or (= (select |c_#valid| .cse17) 1) .cse14) (= .cse1 1) (or (= (select .cse13 0) 0) .cse14) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1338 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| v_ArrVal_1338) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 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)) (forall ((v_ArrVal_1353 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1338 Int)) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 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 (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| v_ArrVal_1338) .cse18) 1) (= .cse18 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|))))))) (not (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (let ((.cse20 (store .cse23 |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 ((.cse19 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse20 .cse21 v_ArrVal_1354)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse19) 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 .cse20 .cse21 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 .cse22 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse21 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) .cse24)) .cse25) (= (select |c_#valid| .cse12) 1) (<= .cse24 8) (or (not (<= (+ .cse2 8) (select |c_#length| .cse12))) (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 .cse22 .cse21 v_ArrVal_1353)) .cse12) .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 .cse23 .cse21 v_ArrVal_1354)) .cse12) .cse2)) 1))) (forall ((v_ArrVal_1354 Int)) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse23 .cse21 v_ArrVal_1354)) .cse12) .cse2))) (or (= .cse26 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= (select |c_#valid| .cse26) 1)))))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 8) (let ((.cse31 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse29 (select .cse31 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (let ((.cse27 (select (select |c_#memory_$Pointer$.base| .cse29) 0)) (.cse28 (= (select (select |c_#memory_$Pointer$.offset| .cse29) 0) 0)) (.cse30 (= (select .cse31 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (or (and (= (select |c_#valid| .cse27) 1) (exists ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) .cse28 (not (= .cse29 .cse27))) (and (= .cse27 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse28 (not (= .cse29 |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (and (exists ((v_arrayElimCell_81 Int)) (and (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_arrayElimCell_81)) (= (select |c_#valid| v_arrayElimCell_81) 1))) .cse30) (and .cse30 (exists ((v_arrayElimIndex_3 Int)) (and (= (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_3) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (not (= v_arrayElimIndex_3 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_3) 0) 0)))))))) (= (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 .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (or (and (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1338 Int)) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 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 (= .cse32 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| v_ArrVal_1338) .cse32) 1)))))) (forall ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| 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_33| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 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)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1338 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| v_ArrVal_1338) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_33|) 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))))) .cse25) (or .cse0 (= .cse2 0)) (let ((.cse33 (= .cse17 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (and .cse33 (exists ((v_arrayElimCell_81 Int)) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_arrayElimCell_81)) (= (select |c_#valid| v_arrayElimCell_81) 1)))) (and .cse33 (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 .cse34 .cse8 .cse9) (and .cse6 .cse7 .cse34 (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|)))))) .cse34))))) is different from false [2023-02-15 22:32:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:32:45,142 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2023-02-15 22:32:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 22:32:45,142 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:32:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:32:45,143 INFO L225 Difference]: With dead ends: 104 [2023-02-15 22:32:45,143 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 22:32:45,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1986 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=658, Invalid=5986, Unknown=2, NotChecked=160, Total=6806 [2023-02-15 22:32:45,147 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 200 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:32:45,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 312 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1295 Invalid, 1 Unknown, 1 Unchecked, 5.1s Time] [2023-02-15 22:32:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 22:32:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 77. [2023-02-15 22:32:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 76 states have internal predecessors, (86), 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:32:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-02-15 22:32:45,149 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 43 [2023-02-15 22:32:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:32:45,150 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-02-15 22:32:45,150 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:32:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-02-15 22:32:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:32:45,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:32:45,151 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:32:45,158 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:32:45,358 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:32:45,358 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:32:45,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:32:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2023-02-15 22:32:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:32:45,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343215347] [2023-02-15 22:32:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:32:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:32:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:32:47,293 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:32:47,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:32:47,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343215347] [2023-02-15 22:32:47,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343215347] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:32:47,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825034230] [2023-02-15 22:32:47,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:32:47,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:32:47,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:32:47,295 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:32:47,299 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:32:47,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:32:47,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:32:47,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-15 22:32:47,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:32:47,527 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:32:47,532 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:32:47,614 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:32:47,615 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:32:47,622 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:32:47,668 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:32:47,675 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:32:47,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:47,727 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:32:47,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:47,735 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:32:47,842 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:32:47,842 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:32:47,929 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:32:47,930 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:32:47,940 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 22:32:47,940 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:32:48,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:48,056 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:32:48,057 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:32:48,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:48,066 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:32:48,066 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:32:48,319 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 22:32:48,320 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:32:48,343 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:32:48,343 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:32:49,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:49,047 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 22:32:49,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 151 treesize of output 151 [2023-02-15 22:32:49,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:49,057 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 22:32:49,057 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:32:49,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:49,550 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:49,566 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2023-02-15 22:32:49,566 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:32:49,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:49,577 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-15 22:32:49,577 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:32:49,655 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:49,677 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-15 22:32:49,678 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:32:49,704 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 22:32:49,705 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:32:49,804 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:49,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:33:18,936 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:18,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:19,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:19,101 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:30,318 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:33:36,483 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:33:36,569 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:33:36,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825034230] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:33:36,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:33:36,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 18] total 54 [2023-02-15 22:33:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049794444] [2023-02-15 22:33:36,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:33:36,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-15 22:33:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:33:36,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-15 22:33:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2786, Unknown=1, NotChecked=0, Total=2970 [2023-02-15 22:33:36,572 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 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:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:33:50,181 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2023-02-15 22:33:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 22:33:50,185 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 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:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:33:50,186 INFO L225 Difference]: With dead ends: 144 [2023-02-15 22:33:50,186 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 22:33:50,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=1686, Invalid=7625, Unknown=1, NotChecked=0, Total=9312 [2023-02-15 22:33:50,190 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2142 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:33:50,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2142 Valid, 394 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 22:33:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 22:33:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 80. [2023-02-15 22:33:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 79 states have internal predecessors, (88), 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:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-02-15 22:33:50,195 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 43 [2023-02-15 22:33:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:33:50,196 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-02-15 22:33:50,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 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:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-02-15 22:33:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:33:50,197 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:33:50,197 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:50,205 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:50,401 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:50,401 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:33:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:33:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash 972990721, now seen corresponding path program 1 times [2023-02-15 22:33:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:33:50,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015113843] [2023-02-15 22:33:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:50,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:33:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:50,500 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:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:33:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015113843] [2023-02-15 22:33:50,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015113843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:33:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739516541] [2023-02-15 22:33:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:50,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:33:50,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:33:50,505 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:50,508 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:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:50,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:33:50,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:33:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-15 22:33:50,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:33:50,695 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:33:50,696 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 12 treesize of output 11 [2023-02-15 22:33:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-15 22:33:50,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739516541] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:33:50,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:33:50,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-02-15 22:33:50,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519262845] [2023-02-15 22:33:50,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:33:50,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:33:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:33:50,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:33:50,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:33:50,700 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:33:50,773 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-02-15 22:33:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:33:50,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:33:50,774 INFO L225 Difference]: With dead ends: 95 [2023-02-15 22:33:50,774 INFO L226 Difference]: Without dead ends: 95 [2023-02-15 22:33:50,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:33:50,774 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 100 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:33:50,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 68 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:33:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-15 22:33:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2023-02-15 22:33:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 80 states have internal predecessors, (89), 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:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-15 22:33:50,777 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 44 [2023-02-15 22:33:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:33:50,777 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-15 22:33:50,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 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:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-15 22:33:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:33:50,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:33:50,778 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:50,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:33:50,984 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:50,984 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:33:50,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:33:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash 972990722, now seen corresponding path program 1 times [2023-02-15 22:33:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:33:50,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956126962] [2023-02-15 22:33:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:50,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:33:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:51,219 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:51,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:33:51,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956126962] [2023-02-15 22:33:51,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956126962] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:33:51,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846609050] [2023-02-15 22:33:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:51,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:33:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:33:51,225 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:51,248 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:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:51,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 22:33:51,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:33:51,427 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:51,553 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:51,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:33:51,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846609050] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:33:51,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:33:51,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2023-02-15 22:33:51,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092730295] [2023-02-15 22:33:51,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:33:51,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:33:51,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:33:51,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:33:51,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:33:51,556 INFO L87 Difference]: Start difference. First operand 81 states and 89 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:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:33:51,714 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2023-02-15 22:33:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:33:51,714 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:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:33:51,715 INFO L225 Difference]: With dead ends: 90 [2023-02-15 22:33:51,715 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 22:33:51,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:33:51,715 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 189 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:33:51,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 44 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:33:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 22:33:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2023-02-15 22:33:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 78 states have internal predecessors, (85), 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:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-02-15 22:33:51,717 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 44 [2023-02-15 22:33:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:33:51,717 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-02-15 22:33:51,718 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:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-02-15 22:33:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:33:51,718 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:33:51,718 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:51,726 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:51,925 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:51,925 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-15 22:33:51,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:33:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash 97977167, now seen corresponding path program 2 times [2023-02-15 22:33:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:33:51,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60863126] [2023-02-15 22:33:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:33:51,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:33:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:33:54,722 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:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:33:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60863126] [2023-02-15 22:33:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60863126] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:33:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865823967] [2023-02-15 22:33:54,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:33:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:33:54,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:33:54,724 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:54,726 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:54,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:33:54,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:33:54,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-15 22:33:54,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:33:54,965 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:55,022 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:55,119 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:33:55,119 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:55,179 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:55,185 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:55,199 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:55,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:55,256 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:55,260 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:55,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:55,268 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:55,455 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:33:55,455 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:55,467 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 22:33:55,467 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:55,486 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:33:55,486 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:55,494 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:55,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:55,624 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:33:55,624 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:55,665 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2023-02-15 22:33:55,665 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:55,692 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:55,729 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:55,789 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:55,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:55,807 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:33:55,807 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:56,116 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 22:33:56,116 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:56,124 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:33:56,124 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:56,144 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:33:56,145 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:56,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:56,898 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 22:33:56,898 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:56,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:56,910 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 22:33:56,910 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:56,938 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2023-02-15 22:33:56,938 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:57,027 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:57,167 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:57,200 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:33:57,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:33:57,852 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 22:33:57,853 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:57,865 INFO L321 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2023-02-15 22:33:57,865 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 88 treesize of output 90 [2023-02-15 22:33:57,883 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2023-02-15 22:33:57,884 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 109 treesize of output 102 [2023-02-15 22:33:57,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:33:57,999 INFO L321 Elim1Store]: treesize reduction 37, result has 35.1 percent of original size [2023-02-15 22:33:58,000 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:58,022 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 22:33:58,023 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:58,251 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:58,293 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:58,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:33:59,531 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~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_~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_~head~0#1.offset|)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse5 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse7 .cse4 v_ArrVal_2127)) .cse1) .cse5))) (or (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (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_~head~0#1.base| v_ArrVal_2128) .cse1 v_ArrVal_2134) .cse0) (+ (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse3 .cse4 v_ArrVal_2126)) .cse1) .cse5) 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (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_~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_~head~0#1.offset|)))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse11 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse12 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse8 (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse14 .cse4 v_ArrVal_2126)) .cse9) .cse12))) (or (= .cse8 |c_ULTIMATE.start_sll_circular_create_~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_~head~0#1.base| v_ArrVal_2128) .cse9 v_ArrVal_2134) (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~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:59,594 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:34:05,722 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:34:05,931 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:34:06,429 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:34:06,570 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:34:07,201 INFO L321 Elim1Store]: treesize reduction 2665, result has 3.1 percent of original size [2023-02-15 22:34:07,202 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:34:09,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:34:09,749 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:34:12,804 INFO L321 Elim1Store]: treesize reduction 351, result has 27.0 percent of original size [2023-02-15 22:34:12,808 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 1073656698 treesize of output 1071035079