./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:40:04,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:40:04,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:40:04,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:40:04,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:40:04,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:40:04,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:40:04,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:40:04,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:40:04,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:40:04,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:40:04,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:40:04,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:40:04,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:40:04,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:40:04,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:40:04,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:40:04,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:40:04,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:40:04,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:40:04,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:40:04,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:40:04,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:40:04,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:40:04,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:40:04,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:40:04,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:40:04,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:40:04,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:40:04,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:40:04,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:40:04,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:40:04,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:40:04,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:40:04,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:40:04,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:40:04,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:40:04,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:40:04,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:40:04,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:40:04,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:40:04,593 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:40:04,613 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:40:04,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:40:04,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:40:04,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:40:04,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:40:04,614 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:40:04,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:40:04,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:40:04,615 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:40:04,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:40:04,616 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:40:04,616 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:40:04,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:40:04,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:40:04,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:40:04,616 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:40:04,616 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:40:04,616 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:40:04,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:40:04,617 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:40:04,617 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:40:04,617 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:40:04,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:40:04,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:40:04,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:40:04,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:40:04,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:40:04,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:40:04,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:40:04,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:40:04,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:40:04,618 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:40:04,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:40:04,619 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:40:04,619 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-02-15 01:40:04,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:40:04,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:40:04,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:40:04,830 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:40:04,830 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:40:04,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-02-15 01:40:05,719 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:40:05,917 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:40:05,917 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-02-15 01:40:05,924 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f80696d/d363651369064b4a89a33123781436cd/FLAG3e9ed2e94 [2023-02-15 01:40:05,936 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f80696d/d363651369064b4a89a33123781436cd [2023-02-15 01:40:05,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:40:05,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:40:05,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:40:05,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:40:05,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:40:05,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:40:05" (1/1) ... [2023-02-15 01:40:05,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b81d724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:05, skipping insertion in model container [2023-02-15 01:40:05,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:40:05" (1/1) ... [2023-02-15 01:40:05,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:40:05,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:40:06,180 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-02-15 01:40:06,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:40:06,192 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:40:06,229 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-02-15 01:40:06,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:40:06,264 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:40:06,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06 WrapperNode [2023-02-15 01:40:06,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:40:06,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:40:06,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:40:06,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:40:06,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,296 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2023-02-15 01:40:06,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:40:06,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:40:06,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:40:06,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:40:06,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,319 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:40:06,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:40:06,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:40:06,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:40:06,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (1/1) ... [2023-02-15 01:40:06,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:40:06,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:06,346 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 01:40:06,347 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 01:40:06,368 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 01:40:06,369 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 01:40:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:40:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:40:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:40:06,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:40:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:40:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:40:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:40:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:40:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:40:06,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:40:06,443 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:40:06,444 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:40:06,484 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 01:40:06,693 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:40:06,697 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:40:06,697 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 01:40:06,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:40:06 BoogieIcfgContainer [2023-02-15 01:40:06,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:40:06,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:40:06,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:40:06,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:40:06,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:40:05" (1/3) ... [2023-02-15 01:40:06,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b4ea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:40:06, skipping insertion in model container [2023-02-15 01:40:06,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:40:06" (2/3) ... [2023-02-15 01:40:06,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b4ea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:40:06, skipping insertion in model container [2023-02-15 01:40:06,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:40:06" (3/3) ... [2023-02-15 01:40:06,705 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-02-15 01:40:06,716 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:40:06,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-02-15 01:40:06,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:40:06,751 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;@510da2e5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:40:06,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-02-15 01:40:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 01:40:06,758 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:06,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 01:40:06,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-15 01:40:06,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:06,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021218733] [2023-02-15 01:40:06,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:06,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:06,918 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 01:40:06,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:06,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021218733] [2023-02-15 01:40:06,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021218733] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:40:06,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:40:06,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:40:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197820635] [2023-02-15 01:40:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:40:06,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:40:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:06,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:40:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:40:06,943 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:07,020 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-02-15 01:40:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:40:07,022 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 01:40:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:07,026 INFO L225 Difference]: With dead ends: 92 [2023-02-15 01:40:07,026 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 01:40:07,027 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 01:40:07,029 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:07,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:40:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 01:40:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2023-02-15 01:40:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2023-02-15 01:40:07,050 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 4 [2023-02-15 01:40:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:07,050 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2023-02-15 01:40:07,050 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 01:40:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2023-02-15 01:40:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 01:40:07,051 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:07,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 01:40:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:40:07,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-15 01:40:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:07,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272438565] [2023-02-15 01:40:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:07,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:07,145 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 01:40:07,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:07,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272438565] [2023-02-15 01:40:07,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272438565] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:40:07,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:40:07,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:40:07,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251269421] [2023-02-15 01:40:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:40:07,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:40:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:07,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:40:07,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:40:07,151 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:07,191 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-02-15 01:40:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:40:07,192 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 01:40:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:07,192 INFO L225 Difference]: With dead ends: 58 [2023-02-15 01:40:07,193 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 01:40:07,193 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 01:40:07,194 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:07,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 42 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:40:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 01:40:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-15 01:40:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2023-02-15 01:40:07,202 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 4 [2023-02-15 01:40:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:07,203 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-02-15 01:40:07,203 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 01:40:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2023-02-15 01:40:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:40:07,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:07,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:07,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:40:07,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2023-02-15 01:40:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:07,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590670307] [2023-02-15 01:40:07,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:07,295 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 01:40:07,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:07,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590670307] [2023-02-15 01:40:07,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590670307] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:40:07,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:40:07,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:40:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590502708] [2023-02-15 01:40:07,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:40:07,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:40:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:07,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:40:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:40:07,297 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:07,371 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2023-02-15 01:40:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:40:07,372 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 01:40:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:07,373 INFO L225 Difference]: With dead ends: 98 [2023-02-15 01:40:07,374 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 01:40:07,375 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 01:40:07,376 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:07,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 118 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:40:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 01:40:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-02-15 01:40:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2023-02-15 01:40:07,383 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2023-02-15 01:40:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:07,384 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2023-02-15 01:40:07,384 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 01:40:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2023-02-15 01:40:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:40:07,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:07,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:07,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:40:07,399 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2023-02-15 01:40:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:07,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188273030] [2023-02-15 01:40:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:07,510 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 01:40:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:07,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188273030] [2023-02-15 01:40:07,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188273030] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:40:07,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:40:07,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:40:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217657927] [2023-02-15 01:40:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:40:07,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:40:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:40:07,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:40:07,515 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:07,556 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-02-15 01:40:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:40:07,556 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 01:40:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:07,558 INFO L225 Difference]: With dead ends: 98 [2023-02-15 01:40:07,558 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 01:40:07,559 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 01:40:07,565 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:07,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:40:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 01:40:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 54. [2023-02-15 01:40:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-02-15 01:40:07,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2023-02-15 01:40:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:07,575 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-02-15 01:40:07,576 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 01:40:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-02-15 01:40:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:40:07,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:07,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:07,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:40:07,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2023-02-15 01:40:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:07,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612159191] [2023-02-15 01:40:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:07,650 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 01:40:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:07,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612159191] [2023-02-15 01:40:07,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612159191] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:40:07,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:40:07,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:40:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193542929] [2023-02-15 01:40:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:40:07,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:40:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:40:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:40:07,653 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:07,661 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-02-15 01:40:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:40:07,662 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 01:40:07,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:07,664 INFO L225 Difference]: With dead ends: 59 [2023-02-15 01:40:07,664 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 01:40:07,665 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 01:40:07,668 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:07,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:40:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 01:40:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2023-02-15 01:40:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-02-15 01:40:07,677 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2023-02-15 01:40:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:07,678 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-02-15 01:40:07,680 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 01:40:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-02-15 01:40:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:40:07,681 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:07,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:07,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:40:07,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2023-02-15 01:40:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:07,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20852766] [2023-02-15 01:40:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:07,770 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 01:40:07,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:07,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20852766] [2023-02-15 01:40:07,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20852766] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:07,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216810028] [2023-02-15 01:40:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:07,774 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 01:40:07,775 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 01:40:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:07,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:40:07,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:07,904 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 01:40:07,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:07,938 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 01:40:07,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216810028] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:40:07,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:40:07,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 01:40:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519103515] [2023-02-15 01:40:07,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:07,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:40:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:40:07,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:40:07,941 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:07,956 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-02-15 01:40:07,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:40:07,956 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 01:40:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:07,957 INFO L225 Difference]: With dead ends: 70 [2023-02-15 01:40:07,957 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 01:40:07,957 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 01:40:07,958 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:07,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 206 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:40:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 01:40:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 01:40:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-15 01:40:07,962 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 16 [2023-02-15 01:40:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:07,962 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-15 01:40:07,962 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 01:40:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-15 01:40:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 01:40:07,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:07,963 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:07,973 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 01:40:08,169 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 01:40:08,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2023-02-15 01:40:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:08,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636087929] [2023-02-15 01:40:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:08,290 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 01:40:08,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:08,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636087929] [2023-02-15 01:40:08,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636087929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:40:08,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:40:08,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:40:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674030277] [2023-02-15 01:40:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:40:08,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:40:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:40:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:40:08,292 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:08,392 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2023-02-15 01:40:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:40:08,392 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 01:40:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:08,393 INFO L225 Difference]: With dead ends: 92 [2023-02-15 01:40:08,393 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 01:40:08,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:40:08,393 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 158 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:08,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 88 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:40:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 01:40:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2023-02-15 01:40:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-02-15 01:40:08,396 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 31 [2023-02-15 01:40:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:08,396 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-02-15 01:40:08,396 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 01:40:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-02-15 01:40:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 01:40:08,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:08,397 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:40:08,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:40:08,398 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2023-02-15 01:40:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:08,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056220874] [2023-02-15 01:40:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:08,559 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 01:40:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:08,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056220874] [2023-02-15 01:40:08,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056220874] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:40:08,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:40:08,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:40:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479886545] [2023-02-15 01:40:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:40:08,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:40:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:40:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:40:08,561 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:08,661 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2023-02-15 01:40:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:40:08,661 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 01:40:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:08,662 INFO L225 Difference]: With dead ends: 73 [2023-02-15 01:40:08,662 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 01:40:08,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:40:08,663 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:08,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 60 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:40:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 01:40:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-15 01:40:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-15 01:40:08,665 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 31 [2023-02-15 01:40:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:08,665 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-15 01:40:08,665 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 01:40:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-15 01:40:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 01:40:08,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:08,666 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 01:40:08,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 01:40:08,666 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash 142544443, now seen corresponding path program 1 times [2023-02-15 01:40:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751141634] [2023-02-15 01:40:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:09,150 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 01:40:09,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:09,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751141634] [2023-02-15 01:40:09,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751141634] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:09,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793119980] [2023-02-15 01:40:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:09,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:09,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:09,155 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 01:40:09,157 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 01:40:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:09,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 01:40:09,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:09,383 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 01:40:09,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:09,431 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 01:40:09,481 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 01:40:09,494 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 01:40:09,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:09,705 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 01:40:09,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793119980] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:40:09,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:40:09,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 01:40:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315152609] [2023-02-15 01:40:09,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:09,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 01:40:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 01:40:09,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-15 01:40:09,707 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:09,922 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-02-15 01:40:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:40:09,922 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 01:40:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:09,923 INFO L225 Difference]: With dead ends: 70 [2023-02-15 01:40:09,923 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 01:40:09,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2023-02-15 01:40:09,924 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 85 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:09,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 315 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:40:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 01:40:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 01:40:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-02-15 01:40:09,925 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 33 [2023-02-15 01:40:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:09,926 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-02-15 01:40:09,926 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 01:40:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-02-15 01:40:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:40:09,926 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:09,926 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 01:40:09,935 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 01:40:10,133 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 01:40:10,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:10,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2023-02-15 01:40:10,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:10,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808561182] [2023-02-15 01:40:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:10,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:10,847 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 01:40:10,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:10,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808561182] [2023-02-15 01:40:10,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808561182] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:10,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341039100] [2023-02-15 01:40:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:10,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:10,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:10,849 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 01:40:10,880 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 01:40:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:10,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 01:40:10,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:11,004 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 01:40:11,030 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:40:11,030 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 01:40:11,062 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 01:40:11,067 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 01:40:11,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:11,095 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 01:40:11,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:11,101 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 01:40:11,152 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:40:11,152 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 01:40:11,162 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 01:40:11,162 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 01:40:11,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:11,334 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:11,335 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 01:40:11,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:11,341 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:11,341 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 01:40:11,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:11,363 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 40 treesize of output 32 [2023-02-15 01:40:11,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:11,369 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 35 treesize of output 31 [2023-02-15 01:40:11,433 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 01:40:11,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:11,711 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 01:40:11,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341039100] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:40:11,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:40:11,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 27 [2023-02-15 01:40:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25027739] [2023-02-15 01:40:11,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:11,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 01:40:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:11,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 01:40:11,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2023-02-15 01:40:11,714 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 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 01:40:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:13,089 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2023-02-15 01:40:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 01:40:13,090 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 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) Word has length 37 [2023-02-15 01:40:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:13,091 INFO L225 Difference]: With dead ends: 156 [2023-02-15 01:40:13,091 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 01:40:13,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=463, Invalid=1517, Unknown=0, NotChecked=0, Total=1980 [2023-02-15 01:40:13,092 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1262 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:13,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 284 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 01:40:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 01:40:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 80. [2023-02-15 01:40:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-02-15 01:40:13,095 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 37 [2023-02-15 01:40:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:13,095 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-02-15 01:40:13,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 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 01:40:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-02-15 01:40:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:40:13,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:13,096 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 01:40:13,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:40:13,303 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 01:40:13,303 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2023-02-15 01:40:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:13,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434507183] [2023-02-15 01:40:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:13,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:13,982 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 01:40:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:13,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434507183] [2023-02-15 01:40:13,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434507183] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:13,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577572796] [2023-02-15 01:40:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:13,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:13,984 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 01:40:13,986 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 01:40:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:14,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 01:40:14,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:14,125 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 01:40:14,182 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:40:14,182 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 01:40:14,218 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 01:40:14,222 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 01:40:14,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:14,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 21 treesize of output 20 [2023-02-15 01:40:14,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:14,262 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 01:40:14,330 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 01:40:14,331 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 01:40:14,339 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:40:14,339 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 01:40:14,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:14,535 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:14,535 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 01:40:14,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:14,541 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:14,541 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 01:40:14,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:14,563 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 40 treesize of output 32 [2023-02-15 01:40:14,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:14,569 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 35 treesize of output 31 [2023-02-15 01:40:14,666 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 01:40:14,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:16,522 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 01:40:16,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577572796] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:40:16,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:40:16,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2023-02-15 01:40:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690404196] [2023-02-15 01:40:16,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:16,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 01:40:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 01:40:16,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 01:40:16,525 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 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 01:40:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:20,135 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2023-02-15 01:40:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 01:40:20,136 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 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 01:40:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:20,138 INFO L225 Difference]: With dead ends: 156 [2023-02-15 01:40:20,138 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 01:40:20,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=963, Invalid=3069, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 01:40:20,140 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1447 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:20,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 256 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 01:40:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 01:40:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 85. [2023-02-15 01:40:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 84 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 01:40:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2023-02-15 01:40:20,144 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 37 [2023-02-15 01:40:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:20,144 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2023-02-15 01:40:20,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 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 01:40:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2023-02-15 01:40:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 01:40:20,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:20,148 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 01:40:20,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:40:20,353 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 01:40:20,354 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash -494379317, now seen corresponding path program 1 times [2023-02-15 01:40:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:20,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059783395] [2023-02-15 01:40:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:40:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:21,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059783395] [2023-02-15 01:40:21,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059783395] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:21,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938642528] [2023-02-15 01:40:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:21,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:21,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:21,321 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 01:40:21,323 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 01:40:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:21,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 01:40:21,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:21,556 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 01:40:21,646 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 01:40:21,652 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 01:40:21,667 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:40:21,667 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 01:40:21,672 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 01:40:21,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:21,709 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 01:40:21,719 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:40:21,719 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 01:40:21,721 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:40:21,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:21,731 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 01:40:21,803 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 01:40:21,804 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 01:40:21,813 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:40:21,814 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 01:40:21,817 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 01:40:22,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:22,035 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:22,035 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 01:40:22,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:22,043 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:22,043 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 01:40:22,053 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:40:22,053 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 01:40:22,063 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:40:22,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:22,117 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 01:40:22,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:22,123 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 01:40:22,239 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 01:40:22,262 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 01:40:22,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:25,219 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse63 (select (store (let ((.cse64 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse64 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse63 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse63 .cse2)))))))))) (.cse12 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse61 (select (store (let ((.cse62 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse61 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse61 .cse2)))))))))) (.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse60 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse11 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse59 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))))) (.cse18 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and .cse0 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse3) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) .cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse2))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (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_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse2))))))) .cse10 .cse11 .cse12 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse2))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse18 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) .cse3) (or .cse3 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (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_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |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_main_~data_init~0#1| (select .cse20 .cse6)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse2)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse22 .cse2))))))))) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |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_main_~data_init~0#1| (select .cse24 .cse6)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse24 .cse2))))) .cse3) .cse10 .cse11 .cse12 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse3) (or (let ((.cse27 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (.cse28 (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (.cse32 (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (.cse34 (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse53 (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse53 .cse2)))))))) (.cse42 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))) (.cse40 (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse2)))))))) (.cse41 (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse49 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))))))) (and (or .cse27 .cse3) (or (and .cse27 .cse28 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse29 .cse2))))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2))) .cse32 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) .cse34 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2)))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse36 .cse2))))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (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_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 .cse2))))) .cse40 .cse41 .cse42) .cse3) .cse28 (or (and .cse28 .cse32 .cse41) .cse3) .cse32 .cse34 (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 .cse6) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse43 .cse2))))))) (or .cse42 .cse3) .cse40 .cse41 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (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_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |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_main_~data_init~0#1| (select .cse45 .cse6)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 .cse2))))) .cse3) (or .cse3 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse47 (select (store (let ((.cse48 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |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_main_~data_init~0#1| (select .cse47 .cse6)) (= (select v_ArrVal_983 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse47 .cse2)))))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) .cse18 (or (and .cse0 .cse11 .cse18) .cse3)))) is different from false [2023-02-15 01:40:26,086 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse34 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse63 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (.cse39 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse61 (select (store (let ((.cse62 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse61 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse61 .cse0)))))))))) (.cse40 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse59 (select (store (let ((.cse60 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse59 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse59 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse35 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse58 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))))))) (.cse36 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse57 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))))))) (and (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse2) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (let ((.cse3 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (.cse4 (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))))) (.cse6 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))) (.cse11 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))) (.cse19 (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse28 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 .cse0)))))))) (.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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) (.cse22 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse25 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (and .cse3 (or (and .cse3 .cse4 .cse5) .cse2) .cse4 (or .cse2 .cse6) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |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 .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse0))))) .cse2) (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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse9 .cse0))))))) (or (and .cse11 .cse3 .cse4 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse0))))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 .cse0))))) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse19 .cse5 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (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_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse20 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse20 .cse0))))) .cse22 .cse6) .cse2) (or .cse11 .cse2) .cse19 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (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_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |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 .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse0))))) .cse2) .cse5 .cse22))) .cse34 (or (and .cse34 .cse35 .cse36) .cse2) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (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_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |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 .cse37 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse37 .cse0))))) .cse2) .cse39 .cse40 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~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_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 .cse0))))))))) .cse35 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse2) (or .cse2 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (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_970))) (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_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |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 .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse44 .cse0)))))) (or .cse2 (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse46 (select (store (let ((.cse47 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse46 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse46 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse48 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) .cse34 .cse39 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse49 (select (store (let ((.cse50 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse49 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse49 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse40 .cse35 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse51 (select (store (let ((.cse52 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse51 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse51 .cse0))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse53 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse54 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse55 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse56 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_970))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse36)) .cse36))) is different from false [2023-02-15 01:40:26,567 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse5 (forall ((v_subst_22 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_22) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse63 (store |c_#memory_int| v_subst_22 v_ArrVal_970))) (store .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_22 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22)))) (.cse12 (forall ((v_subst_27 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_27) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse61 (select (store (let ((.cse62 (store |c_#memory_int| v_subst_27 v_ArrVal_970))) (store .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_27 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse61 .cse1)) (= (select .cse61 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse6 (forall ((v_subst_29 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse60 (store |c_#memory_int| v_subst_29 v_ArrVal_970))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_29 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_29))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_29)))) (.cse7 (forall ((v_subst_23 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_23) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_23) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse59 (store |c_#memory_int| v_subst_23 v_ArrVal_970))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_23 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse19 (forall ((v_subst_20 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_20) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse57 (select (store (let ((.cse58 (store |c_#memory_int| v_subst_20 v_ArrVal_970))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_20 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse57 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse57 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_32 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_32) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_32) (= (select (select (store (let ((.cse0 (store |c_#memory_int| v_subst_32 v_ArrVal_970))) (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_973))) v_subst_32 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_33 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse3 (select (store (let ((.cse4 (store |c_#memory_int| v_subst_33 v_ArrVal_970))) (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_973))) v_subst_33 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse3 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_33) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 .cse1))))) .cse2) (or .cse2 (and .cse5 .cse6 .cse7)) .cse5 (or .cse2 (and (forall ((v_subst_28 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int| v_subst_28 v_ArrVal_970))) (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_973))) v_subst_28 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 4)) (= (select .cse8 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_subst_18 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse10 (store |c_#memory_int| v_subst_18 v_ArrVal_970))) (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_973))) v_subst_18 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_18))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18))) .cse5 (forall ((v_subst_19 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse11 (store |c_#memory_int| v_subst_19 v_ArrVal_970))) (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_973))) v_subst_19 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse12 .cse6 (forall ((v_subst_21 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| v_subst_21 v_ArrVal_970))) (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_973))) v_subst_21 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse13 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse7 (forall ((v_subst_26 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse15 (store |c_#memory_int| v_subst_26 v_ArrVal_970))) (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_973))) v_subst_26 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_26))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_26))) (forall ((v_subst_24 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse16 (store |c_#memory_int| v_subst_24 v_ArrVal_970))) (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_973))) v_subst_24 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_subst_25 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int| v_subst_25 v_ArrVal_970))) (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_973))) v_subst_25 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse17 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 .cse1))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_25))) .cse19 (forall ((v_subst_30 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_30) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse20 (store |c_#memory_int| v_subst_30 v_ArrVal_970))) (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_973))) v_subst_30 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse12 .cse6 (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (let ((.cse21 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_4 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_4) (= (select (select (store (let ((.cse51 (store |c_#memory_int| v_subst_4 v_ArrVal_970))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_4 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse22 (forall ((v_subst_9 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse50 (store |c_#memory_int| v_subst_9 v_ArrVal_970))) (store .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_9 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse25 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_11 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse49 (store |c_#memory_int| v_subst_11 v_ArrVal_970))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_11 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_11)))) (.cse35 (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse47 (select (store (let ((.cse48 (store |c_#memory_int| v_subst_5 v_ArrVal_970))) (store .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_5 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse47 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse47 .cse1))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5)))) (.cse23 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_10 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_10) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse46 (store |c_#memory_int| v_subst_10 v_ArrVal_970))) (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_973))) v_subst_10 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse24 (forall ((v_subst_14 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse45 (store |c_#memory_int| v_subst_14 v_ArrVal_970))) (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_973))) v_subst_14 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_14)))) (.cse37 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| v_subst_3 v_ArrVal_970))) (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_973))) v_subst_3 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse43 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse43 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3))))) (and (or .cse21 .cse2) (or .cse2 (and .cse22 .cse23 .cse24)) (or .cse25 .cse2) (forall ((v_subst_16 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_16) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| v_subst_16 v_ArrVal_970))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_16 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse26 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse26 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse22 (or (forall ((v_ArrVal_973 Int) (v_subst_15 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| v_subst_15 v_ArrVal_970))) (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_973))) v_subst_15 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_15) (= (select .cse28 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse28 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (and .cse21 (forall ((v_ArrVal_973 Int) (v_subst_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse30 (store |c_#memory_int| v_subst_8 v_ArrVal_970))) (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_973))) v_subst_8 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse22 .cse25 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_2 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| v_subst_2 v_ArrVal_970))) (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_973))) v_subst_2 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 4))))) (forall ((v_ArrVal_973 Int) (v_subst_13 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| v_subst_13 v_ArrVal_970))) (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_973))) v_subst_13 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse35 .cse23 (forall ((v_ArrVal_973 Int) (v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse36 (store |c_#memory_int| v_subst_7 v_ArrVal_970))) (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_973))) v_subst_7 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) .cse24 .cse37 (forall ((v_ArrVal_973 Int) (v_subst_12 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse38 (store |c_#memory_int| v_subst_12 v_ArrVal_970))) (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_973))) v_subst_12 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_973 Int) (v_subst_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| v_subst_6 v_ArrVal_970))) (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_973))) v_subst_6 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse39 4)))))) .cse2) .cse35 .cse23 .cse24 .cse37 (or .cse2 (forall ((v_ArrVal_973 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| v_subst_17 v_ArrVal_970))) (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_973))) v_subst_17 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 .cse1)) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse41 4))))))))) .cse7 (forall ((v_subst_34 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse52 (select (store (let ((.cse53 (store |c_#memory_int| v_subst_34 v_ArrVal_970))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_34 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_34))))) .cse19 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_1 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse54 (select (store (let ((.cse55 (store |c_#memory_int| v_subst_1 v_ArrVal_970))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_1 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_1) (= (select .cse54 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse54 .cse1))))) .cse2) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_subst_31 Int) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_31) (= (select (select (store (let ((.cse56 (store |c_#memory_int| v_subst_31 v_ArrVal_970))) (store .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_31 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_31))) .cse2)))) is different from false [2023-02-15 01:40:26,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:26,705 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 37 [2023-02-15 01:40:26,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:26,708 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:26,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:26,715 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 41 treesize of output 43 [2023-02-15 01:40:26,724 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:26,733 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 41 treesize of output 29 [2023-02-15 01:40:26,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:26,742 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 13 treesize of output 15 [2023-02-15 01:40:26,751 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:26,752 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 01:40:26,757 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:26,757 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 01:40:26,762 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:26,762 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 01:40:26,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:26,767 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 91 treesize of output 61 [2023-02-15 01:40:26,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:26,776 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:40:26,776 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 1109 treesize of output 1062 [2023-02-15 01:40:26,780 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:26,782 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:26,783 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 1107 treesize of output 1059 [2023-02-15 01:40:26,788 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:26,789 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 517 treesize of output 493 [2023-02-15 01:40:26,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:26,794 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 1042 treesize of output 942 [2023-02-15 01:40:26,797 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:26,798 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 947 treesize of output 919 [2023-02-15 01:40:27,461 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,463 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,464 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,465 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,466 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,468 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,469 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,470 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,471 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,472 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,473 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,474 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,475 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,476 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,478 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,479 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,480 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,482 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,484 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,485 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,486 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,488 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,489 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,490 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,491 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:40:27,498 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,499 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 01:40:27,504 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,505 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 01:40:27,509 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,509 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 01:40:27,513 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 01:40:27,517 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,518 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 01:40:27,522 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,522 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 01:40:27,527 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,527 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 01:40:27,531 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2023-02-15 01:40:27,536 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,536 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 01:40:27,540 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-02-15 01:40:27,548 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,548 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 01:40:27,552 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,552 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 01:40:27,559 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,559 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 01:40:27,563 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,564 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 01:40:27,570 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,570 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 01:40:27,574 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,574 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 01:40:27,580 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,580 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 01:40:27,584 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,584 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 01:40:27,589 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,589 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 01:40:27,594 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,594 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 01:40:27,598 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,598 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 01:40:27,603 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:40:27,603 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 01:40:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 13 not checked. [2023-02-15 01:40:27,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938642528] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:40:27,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:40:27,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 48 [2023-02-15 01:40:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646948336] [2023-02-15 01:40:27,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:27,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 01:40:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 01:40:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1807, Unknown=43, NotChecked=264, Total=2256 [2023-02-15 01:40:27,720 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 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 01:40:38,724 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse71 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse65 (select .cse71 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse63 (select |c_#memory_int| .cse65)) (.cse68 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse64 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (.cse66 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (let ((.cse3 (not .cse66)) (.cse9 (= (select .cse6 .cse64) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse11 (forall ((v_subst_22 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_22) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse81 (store |c_#memory_int| v_subst_22 v_ArrVal_970))) (store .cse81 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_22 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_22)))) (.cse18 (forall ((v_subst_27 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_27) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_27) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse79 (select (store (let ((.cse80 (store |c_#memory_int| v_subst_27 v_ArrVal_970))) (store .cse80 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_27 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse79 .cse1)) (= (select .cse79 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse12 (forall ((v_subst_29 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse78 (store |c_#memory_int| v_subst_29 v_ArrVal_970))) (store .cse78 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_29 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_29))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_29)))) (.cse27 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (.cse62 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse65)) (.cse8 (select |c_#memory_int| .cse68)) (.cse7 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse68)) (.cse28 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0)) (.cse10 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse13 (forall ((v_subst_23 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_23) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_23) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse77 (store |c_#memory_int| v_subst_23 v_ArrVal_970))) (store .cse77 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse77 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_23 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (.cse29 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (.cse25 (forall ((v_subst_20 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_20) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse75 (select (store (let ((.cse76 (store |c_#memory_int| v_subst_20 v_ArrVal_970))) (store .cse76 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_20 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse75 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse75 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_20)))) (.cse67 (= (select .cse63 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_32 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_32) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_32) (= (select (select (store (let ((.cse0 (store |c_#memory_int| v_subst_32 v_ArrVal_970))) (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_973))) v_subst_32 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) .cse3 (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_33 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_int| v_subst_33 v_ArrVal_970))) (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_973))) v_subst_33 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_33) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_33) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 .cse1))))) .cse2) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (or .cse7 (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse9 (not .cse10) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (or .cse2 (and .cse11 .cse12 .cse13)) (or (and (or (and .cse3 .cse9) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_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|)) .cse10) .cse11 (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (or .cse2 (and (forall ((v_subst_28 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_28) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| v_subst_28 v_ArrVal_970))) (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_973))) v_subst_28 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse14 4)) (= (select .cse14 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_subst_18 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse16 (store |c_#memory_int| v_subst_18 v_ArrVal_970))) (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_973))) v_subst_18 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_18))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_18))) .cse11 (forall ((v_subst_19 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_19) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse17 (store |c_#memory_int| v_subst_19 v_ArrVal_970))) (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_973))) v_subst_19 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse18 .cse12 (forall ((v_subst_21 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_21) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| v_subst_21 v_ArrVal_970))) (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_973))) v_subst_21 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse19 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse13 (forall ((v_subst_26 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse21 (store |c_#memory_int| v_subst_26 v_ArrVal_970))) (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_973))) v_subst_26 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_26))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_26))) (forall ((v_subst_24 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_24) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse22 (store |c_#memory_int| v_subst_24 v_ArrVal_970))) (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_973))) v_subst_24 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_subst_25 Int)) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| v_subst_25 v_ArrVal_970))) (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_973))) v_subst_25 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse1))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_25))) .cse25 (forall ((v_subst_30 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_30) (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse26 (store |c_#memory_int| v_subst_30 v_ArrVal_970))) (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_973))) v_subst_30 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) .cse18 .cse27 .cse12 .cse28 (or .cse29 (let ((.cse30 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_4 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_4) (= (select (select (store (let ((.cse60 (store |c_#memory_int| v_subst_4 v_ArrVal_970))) (store .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_4 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (.cse31 (forall ((v_subst_9 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse59 (store |c_#memory_int| v_subst_9 v_ArrVal_970))) (store .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_9 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (.cse34 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_11 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select (select (store (let ((.cse58 (store |c_#memory_int| v_subst_11 v_ArrVal_970))) (store .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_11 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_11)))) (.cse44 (forall ((v_subst_5 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse56 (select (store (let ((.cse57 (store |c_#memory_int| v_subst_5 v_ArrVal_970))) (store .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_5 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse56 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse56 .cse1))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_5)))) (.cse32 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_10 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_10) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse55 (store |c_#memory_int| v_subst_10 v_ArrVal_970))) (store .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_10 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) (.cse33 (forall ((v_subst_14 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (let ((.cse54 (store |c_#memory_int| v_subst_14 v_ArrVal_970))) (store .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_14 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_14)))) (.cse46 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse52 (select (store (let ((.cse53 (store |c_#memory_int| v_subst_3 v_ArrVal_970))) (store .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_3 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse52 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3))))) (and (or .cse30 .cse2) (or .cse2 (and .cse31 .cse32 .cse33)) (or .cse34 .cse2) (forall ((v_subst_16 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_16) (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| v_subst_16 v_ArrVal_970))) (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_973))) v_subst_16 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse31 (or (forall ((v_ArrVal_973 Int) (v_subst_15 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| v_subst_15 v_ArrVal_970))) (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_973))) v_subst_15 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_15) (= (select .cse37 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse37 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (and .cse30 (forall ((v_ArrVal_973 Int) (v_subst_8 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (= (select (select (store (let ((.cse39 (store |c_#memory_int| v_subst_8 v_ArrVal_970))) (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_973))) v_subst_8 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse31 .cse34 (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_2 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| v_subst_2 v_ArrVal_970))) (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_973))) v_subst_2 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 4))))) (forall ((v_ArrVal_973 Int) (v_subst_13 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| v_subst_13 v_ArrVal_970))) (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_973))) v_subst_13 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse44 .cse32 (forall ((v_ArrVal_973 Int) (v_subst_7 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse45 (store |c_#memory_int| v_subst_7 v_ArrVal_970))) (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_973))) v_subst_7 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) .cse33 .cse46 (forall ((v_ArrVal_973 Int) (v_subst_12 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse47 (store |c_#memory_int| v_subst_12 v_ArrVal_970))) (store .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_12 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_973 Int) (v_subst_6 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse48 (select (store (let ((.cse49 (store |c_#memory_int| v_subst_6 v_ArrVal_970))) (store .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_6 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse48 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse48 4)))))) .cse2) .cse44 .cse32 .cse33 .cse46 (or .cse2 (forall ((v_ArrVal_973 Int) (v_subst_17 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse50 (select (store (let ((.cse51 (store |c_#memory_int| v_subst_17 v_ArrVal_970))) (store .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_17 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 .cse1)) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 4))))))))) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) .cse2 (let ((.cse61 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and .cse61 .cse27 (or .cse62 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse63 .cse64)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse65))))) (and .cse61 .cse66))) (or .cse62 .cse67) (or (and (or (and (= (select .cse8 .cse64) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse68))) .cse7) .cse28) .cse10) .cse13 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((v_subst_34 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_34) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse69 (select (store (let ((.cse70 (store |c_#memory_int| v_subst_34 v_ArrVal_970))) (store .cse70 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse70 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_34 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_983 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse69 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse69 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_34))))) .cse29 .cse25 (or (and (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_~head~0#1.base|) (= (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|))) .cse67) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select .cse71 0))) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_1 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse72 (select (store (let ((.cse73 (store |c_#memory_int| v_subst_1 v_ArrVal_970))) (store .cse73 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_1 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_1) (= (select .cse72 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse72 .cse1))))) .cse2) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or (forall ((v_ArrVal_973 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_970 (Array Int Int)) (v_subst_31 Int) (v_ArrVal_983 (Array Int Int))) (or (= (select v_ArrVal_983 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_31) (= (select (select (store (let ((.cse74 (store |c_#memory_int| v_subst_31 v_ArrVal_970))) (store .cse74 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_31 v_ArrVal_983) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_31))) .cse2)))))) is different from true [2023-02-15 01:40:44,833 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 174 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:40:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:47,077 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2023-02-15 01:40:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 01:40:47,078 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 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 01:40:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:47,078 INFO L225 Difference]: With dead ends: 123 [2023-02-15 01:40:47,078 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 01:40:47,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=572, Invalid=4091, Unknown=45, NotChecked=548, Total=5256 [2023-02-15 01:40:47,080 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 421 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 40 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:47,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 384 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1260 Invalid, 5 Unknown, 243 Unchecked, 1.4s Time] [2023-02-15 01:40:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 01:40:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 85. [2023-02-15 01:40:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 84 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2023-02-15 01:40:47,082 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 39 [2023-02-15 01:40:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:47,082 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2023-02-15 01:40:47,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 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 01:40:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2023-02-15 01:40:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:40:47,083 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:47,083 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 01:40:47,093 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 01:40:47,290 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 01:40:47,291 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:47,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999412, now seen corresponding path program 1 times [2023-02-15 01:40:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:47,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611601947] [2023-02-15 01:40:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:47,815 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 01:40:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611601947] [2023-02-15 01:40:47,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611601947] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839222098] [2023-02-15 01:40:47,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:47,818 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 01:40:47,820 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 01:40:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:47,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-15 01:40:47,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:47,952 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 01:40:48,023 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:40:48,023 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 01:40:48,065 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:40:48,065 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 01:40:48,132 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:40:48,133 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 01:40:48,236 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 01:40:48,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:40:48,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:40:48,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:48,333 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 22 treesize of output 21 [2023-02-15 01:40:48,407 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 20 treesize of output 19 [2023-02-15 01:40:48,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:48,589 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:48,589 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 37 treesize of output 34 [2023-02-15 01:40:48,643 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-15 01:40:48,643 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 31 treesize of output 21 [2023-02-15 01:40:48,649 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 01:40:48,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:49,137 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 01:40:49,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839222098] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:40:49,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:40:49,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2023-02-15 01:40:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212803400] [2023-02-15 01:40:49,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:49,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 01:40:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:49,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 01:40:49,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2023-02-15 01:40:49,139 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 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 01:40:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:49,844 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-02-15 01:40:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 01:40:49,844 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 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 01:40:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:49,845 INFO L225 Difference]: With dead ends: 105 [2023-02-15 01:40:49,845 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 01:40:49,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 01:40:49,846 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 280 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:49,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 489 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:40:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 01:40:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2023-02-15 01:40:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:40:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-15 01:40:49,848 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 40 [2023-02-15 01:40:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:49,848 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-15 01:40:49,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 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 01:40:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-15 01:40:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:40:49,849 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:49,849 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 01:40:49,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 01:40:50,054 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 01:40:50,055 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:40:50,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2023-02-15 01:40:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:50,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693361484] [2023-02-15 01:40:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:52,075 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 01:40:52,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:52,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693361484] [2023-02-15 01:40:52,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693361484] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:52,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164981668] [2023-02-15 01:40:52,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:40:52,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:52,077 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 01:40:52,079 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 01:40:52,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:40:52,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:40:52,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 98 conjunts are in the unsatisfiable core [2023-02-15 01:40:52,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:52,247 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 01:40:52,284 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:40:52,284 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 01:40:52,340 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 01:40:52,345 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 01:40:52,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:52,401 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 01:40:52,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:52,407 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 01:40:52,472 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:40:52,472 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 24 treesize of output 34 [2023-02-15 01:40:52,575 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 01:40:52,575 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 36 treesize of output 31 [2023-02-15 01:40:52,585 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 01:40:52,586 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 01:40:52,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:52,676 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:52,676 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 65 treesize of output 46 [2023-02-15 01:40:52,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:52,695 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:40:52,695 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 01:40:52,835 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-15 01:40:52,835 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 63 treesize of output 60 [2023-02-15 01:40:52,862 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 01:40:52,862 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 01:40:53,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:53,457 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 01:40:53,457 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 125 treesize of output 117 [2023-02-15 01:40:53,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:53,467 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 01:40:53,467 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 118 treesize of output 97 [2023-02-15 01:40:54,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:54,154 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 01:40:54,155 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 84 treesize of output 72 [2023-02-15 01:40:54,193 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2023-02-15 01:40:54,194 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 91 treesize of output 84 [2023-02-15 01:40:54,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:54,318 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2023-02-15 01:40:54,318 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 111 treesize of output 84 [2023-02-15 01:40:54,352 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-15 01:40:54,352 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 54 treesize of output 52 [2023-02-15 01:40:54,615 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 01:40:54,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:42:49,899 WARN L233 SmtUtils]: Spent 32.39s on a formula simplification. DAG size of input: 82 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:42:50,583 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 01:42:50,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164981668] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:42:50,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:42:50,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 52 [2023-02-15 01:42:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63982378] [2023-02-15 01:42:50,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:42:50,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-15 01:42:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:42:50,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-15 01:42:50,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2596, Unknown=0, NotChecked=0, Total=2756 [2023-02-15 01:42:50,585 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 53 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 53 states have internal predecessors, (109), 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 01:43:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:07,825 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2023-02-15 01:43:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-15 01:43:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 53 states have internal predecessors, (109), 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 01:43:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:07,826 INFO L225 Difference]: With dead ends: 184 [2023-02-15 01:43:07,826 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 01:43:07,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 65.6s TimeCoverageRelationStatistics Valid=1806, Invalid=7700, Unknown=0, NotChecked=0, Total=9506 [2023-02-15 01:43:07,828 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2405 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 2028 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2405 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:07,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2405 Valid, 650 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2028 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-15 01:43:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 01:43:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 84. [2023-02-15 01:43:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 83 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2023-02-15 01:43:07,830 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 43 [2023-02-15 01:43:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:07,830 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-15 01:43:07,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 53 states have internal predecessors, (109), 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 01:43:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2023-02-15 01:43:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:43:07,831 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:07,831 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 01:43:07,836 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 01:43:08,036 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 01:43:08,036 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-02-15 01:43:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2023-02-15 01:43:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:08,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431926667] [2023-02-15 01:43:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:10,013 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 01:43:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:10,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431926667] [2023-02-15 01:43:10,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431926667] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:43:10,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553671407] [2023-02-15 01:43:10,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:43:10,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:43:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:43:10,015 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 01:43:10,016 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 01:43:10,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:43:10,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:43:10,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 106 conjunts are in the unsatisfiable core [2023-02-15 01:43:10,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:10,175 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 01:43:10,252 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:43:10,252 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 01:43:10,282 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:43:10,282 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 01:43:10,293 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 01:43:10,467 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:43:10,468 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 01:43:10,493 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 01:43:10,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:43:10,596 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 01:43:10,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:43:10,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:10,677 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 31 treesize of output 26 [2023-02-15 01:43:10,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:10,692 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 21 treesize of output 20 [2023-02-15 01:43:10,809 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:43:10,809 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 01:43:10,924 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 01:43:10,925 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 37 treesize of output 32 [2023-02-15 01:43:10,941 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 01:43:10,942 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 23 treesize of output 22 [2023-02-15 01:43:11,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:11,058 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:43:11,058 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 01:43:11,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:11,066 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:43:11,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 01:43:11,259 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 01:43:11,260 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 68 [2023-02-15 01:43:11,277 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 01:43:11,278 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 2 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 01:43:11,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:12,000 INFO L321 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-02-15 01:43:12,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 147 treesize of output 121 [2023-02-15 01:43:12,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:12,011 INFO L321 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2023-02-15 01:43:12,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 165 [2023-02-15 01:43:12,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:12,747 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 01:43:12,748 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 5 case distinctions, treesize of input 88 treesize of output 64 [2023-02-15 01:43:12,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:12,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:43:12,773 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-02-15 01:43:12,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-02-15 01:43:12,885 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:43:12,912 INFO L321 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2023-02-15 01:43:12,912 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 98 treesize of output 59 [2023-02-15 01:43:12,932 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:43:12,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2023-02-15 01:43:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:43:13,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:43:53,136 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 58 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:44:04,171 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse10 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1571 Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1556 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse1 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1554)))) (store .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (store .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|)))) (.cse5 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1552)))) (store .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select .cse8 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse6 (select .cse5 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|)) (.cse2 (select .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))) (let ((.cse3 (select .cse2 0)) (.cse4 (select .cse6 0))) (let ((.cse0 (select (select (store .cse5 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse6 4 v_ArrVal_1571)) .cse3) .cse4))) (or (= .cse0 0) (forall ((v_ArrVal_1572 Int)) (<= (+ .cse0 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1556) (select (select (store .cse1 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse2 4 v_ArrVal_1572)) .cse3) .cse4)))))))))) (forall ((v_ArrVal_1571 Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (<= 0 (+ (let ((.cse14 (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1552)))) (store .cse19 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select .cse19 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (store .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse15 (select .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))) (select (select (store .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse15 4 v_ArrVal_1571)) (select (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1554)))) (store .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (store .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0)) (select .cse15 0)))) 4))) (forall ((v_ArrVal_1572 Int) (v_ArrVal_1552 Int) (v_ArrVal_1554 Int) (v_ArrVal_1556 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| Int)) (let ((.cse25 (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1554)))) (store .cse30 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select .cse30 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (store .cse29 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|)))) (.cse21 (let ((.cse27 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1552)))) (store .cse28 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store (select .cse28 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (store .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |c_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_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|)) (.cse26 (select .cse25 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36|))) (let ((.cse23 (select .cse26 0)) (.cse24 (select .cse22 0))) (let ((.cse20 (select (select (store .cse25 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse26 4 v_ArrVal_1572)) .cse23) .cse24))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| .cse20) (forall ((v_ArrVal_1571 Int)) (<= (+ (select (select (store .cse21 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| (store .cse22 4 v_ArrVal_1571)) .cse23) .cse24) 8) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_36| v_ArrVal_1556) .cse20))))))))))) is different from false [2023-02-15 01:44:04,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:44:04,231 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 42564 treesize of output 42236 [2023-02-15 01:44:04,493 INFO L321 Elim1Store]: treesize reduction 194, result has 38.6 percent of original size [2023-02-15 01:44:04,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 386928 treesize of output 377949 [2023-02-15 01:44:04,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:44:04,588 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 374511 treesize of output 374393 [2023-02-15 01:44:04,732 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 01:44:05,445 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:44:05,547 INFO L321 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2023-02-15 01:44:05,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 131 [2023-02-15 01:44:07,699 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:44:07,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:44:07,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 106 [2023-02-15 01:44:08,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:44:08,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 375551 treesize of output 375439