./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-13 23:44:14,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:44:14,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:44:14,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:44:14,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:44:14,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:44:14,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:44:14,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:44:14,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:44:14,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:44:14,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:44:14,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:44:14,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:44:14,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:44:14,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:44:14,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:44:14,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:44:14,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:44:14,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:44:14,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:44:14,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:44:14,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:44:14,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:44:14,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:44:14,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:44:14,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:44:14,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:44:14,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:44:14,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:44:14,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:44:14,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:44:14,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:44:14,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:44:14,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:44:14,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:44:14,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:44:14,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:44:14,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:44:14,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:44:14,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:44:14,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:44:14,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-13 23:44:14,317 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:44:14,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:44:14,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:44:14,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:44:14,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:44:14,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:44:14,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:44:14,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:44:14,320 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:44:14,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:44:14,321 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:44:14,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:44:14,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:44:14,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:44:14,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:44:14,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:44:14,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:44:14,323 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:44:14,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:44:14,323 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:44:14,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:44:14,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:44:14,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:44:14,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:44:14,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:44:14,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:44:14,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:44:14,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:44:14,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:44:14,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:44:14,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:44:14,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:44:14,326 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:44:14,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:44:14,326 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:44:14,327 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 ! call(reach_error())) ) 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-13 23:44:14,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:44:14,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:44:14,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:44:14,570 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:44:14,570 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:44:14,571 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-13 23:44:15,838 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:44:16,111 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:44:16,112 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-02-13 23:44:16,121 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47379bee8/0655f6d068b94e5b907411c1b426146b/FLAG95b4df954 [2023-02-13 23:44:16,132 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47379bee8/0655f6d068b94e5b907411c1b426146b [2023-02-13 23:44:16,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:44:16,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:44:16,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:44:16,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:44:16,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:44:16,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6d0dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16, skipping insertion in model container [2023-02-13 23:44:16,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:44:16,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:44:16,499 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-13 23:44:16,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:44:16,513 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:44:16,560 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-13 23:44:16,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:44:16,584 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:44:16,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16 WrapperNode [2023-02-13 23:44:16,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:44:16,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:44:16,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:44:16,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:44:16,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,619 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2023-02-13 23:44:16,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:44:16,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:44:16,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:44:16,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:44:16,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,685 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:44:16,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:44:16,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:44:16,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:44:16,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (1/1) ... [2023-02-13 23:44:16,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:44:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:44:16,722 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-13 23:44:16,740 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-13 23:44:16,772 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-13 23:44:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-13 23:44:16,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-13 23:44:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-13 23:44:16,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-13 23:44:16,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:44:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-13 23:44:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-13 23:44:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-13 23:44:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:44:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:44:16,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:44:16,862 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:44:16,864 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:44:16,898 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-13 23:44:17,029 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:44:17,035 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:44:17,035 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-13 23:44:17,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:44:17 BoogieIcfgContainer [2023-02-13 23:44:17,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:44:17,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:44:17,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:44:17,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:44:17,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:44:16" (1/3) ... [2023-02-13 23:44:17,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe7899f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:44:17, skipping insertion in model container [2023-02-13 23:44:17,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:44:16" (2/3) ... [2023-02-13 23:44:17,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe7899f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:44:17, skipping insertion in model container [2023-02-13 23:44:17,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:44:17" (3/3) ... [2023-02-13 23:44:17,045 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-02-13 23:44:17,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:44:17,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-13 23:44:17,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:44:17,109 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@738c712, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:44:17,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-13 23:44:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 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-13 23:44:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-13 23:44:17,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:44:17,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:44:17,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:44:17,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:44:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash 70364755, now seen corresponding path program 1 times [2023-02-13 23:44:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:44:17,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704730491] [2023-02-13 23:44:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:44:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:17,326 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-13 23:44:17,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:44:17,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704730491] [2023-02-13 23:44:17,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704730491] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:44:17,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:44:17,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 23:44:17,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876252006] [2023-02-13 23:44:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:44:17,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-13 23:44:17,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:44:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-13 23:44:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-13 23:44:17,377 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-13 23:44:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:44:17,391 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2023-02-13 23:44:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-13 23:44:17,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2023-02-13 23:44:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:44:17,399 INFO L225 Difference]: With dead ends: 45 [2023-02-13 23:44:17,399 INFO L226 Difference]: Without dead ends: 20 [2023-02-13 23:44:17,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-13 23:44:17,404 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:44:17,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:44:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-13 23:44:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-13 23:44:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-13 23:44:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-02-13 23:44:17,431 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-02-13 23:44:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:44:17,432 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-02-13 23:44:17,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-13 23:44:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-02-13 23:44:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-13 23:44:17,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:44:17,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:44:17,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-13 23:44:17,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:44:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:44:17,435 INFO L85 PathProgramCache]: Analyzing trace with hash -273185057, now seen corresponding path program 1 times [2023-02-13 23:44:17,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:44:17,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962529544] [2023-02-13 23:44:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:17,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:44:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:17,649 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-13 23:44:17,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:44:17,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962529544] [2023-02-13 23:44:17,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962529544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:44:17,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:44:17,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:44:17,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319699927] [2023-02-13 23:44:17,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:44:17,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:44:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:44:17,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:44:17,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:44:17,654 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-13 23:44:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:44:17,683 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-02-13 23:44:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:44:17,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-02-13 23:44:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:44:17,684 INFO L225 Difference]: With dead ends: 36 [2023-02-13 23:44:17,685 INFO L226 Difference]: Without dead ends: 23 [2023-02-13 23:44:17,685 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-13 23:44:17,686 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 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-13 23:44:17,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:44:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-13 23:44:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-02-13 23:44:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-13 23:44:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-02-13 23:44:17,690 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2023-02-13 23:44:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:44:17,691 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-13 23:44:17,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-13 23:44:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-02-13 23:44:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-13 23:44:17,691 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:44:17,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:44:17,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-13 23:44:17,691 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:44:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:44:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2002783247, now seen corresponding path program 1 times [2023-02-13 23:44:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:44:17,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370681876] [2023-02-13 23:44:17,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:17,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:44:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:17,789 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-13 23:44:17,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:44:17,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370681876] [2023-02-13 23:44:17,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370681876] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:44:17,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979492865] [2023-02-13 23:44:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:17,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:44:17,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:44:17,793 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-13 23:44:17,805 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-13 23:44:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:17,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 23:44:17,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:44:17,987 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-13 23:44:17,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:44:18,034 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-13 23:44:18,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979492865] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:44:18,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:44:18,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-13 23:44:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034420759] [2023-02-13 23:44:18,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:44:18,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:44:18,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:44:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:44:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:44:18,043 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-13 23:44:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:44:18,087 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2023-02-13 23:44:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:44:18,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 13 [2023-02-13 23:44:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:44:18,089 INFO L225 Difference]: With dead ends: 43 [2023-02-13 23:44:18,089 INFO L226 Difference]: Without dead ends: 30 [2023-02-13 23:44:18,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-13 23:44:18,093 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 43 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-13 23:44:18,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 43 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:44:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-13 23:44:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-13 23:44:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-13 23:44:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-13 23:44:18,105 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2023-02-13 23:44:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:44:18,105 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-13 23:44:18,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-13 23:44:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-13 23:44:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-13 23:44:18,108 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:44:18,108 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:44:18,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-13 23:44:18,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:44:18,318 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:44:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:44:18,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1740729055, now seen corresponding path program 2 times [2023-02-13 23:44:18,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:44:18,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702849123] [2023-02-13 23:44:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:44:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-13 23:44:19,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:44:19,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702849123] [2023-02-13 23:44:19,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702849123] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:44:19,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392234033] [2023-02-13 23:44:19,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 23:44:19,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:44:19,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:44:19,201 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-13 23:44:19,205 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-13 23:44:19,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 23:44:19,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:44:19,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-13 23:44:19,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:44:19,493 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-13 23:44:19,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:19,540 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-13 23:44:19,593 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-13 23:44:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-13 23:44:19,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:44:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-13 23:44:19,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392234033] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:44:19,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:44:19,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2023-02-13 23:44:19,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088336196] [2023-02-13 23:44:19,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:44:19,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-13 23:44:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:44:19,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-13 23:44:19,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-02-13 23:44:19,846 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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-13 23:44:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:44:20,253 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-13 23:44:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-13 23:44:20,257 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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 22 [2023-02-13 23:44:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:44:20,258 INFO L225 Difference]: With dead ends: 41 [2023-02-13 23:44:20,258 INFO L226 Difference]: Without dead ends: 39 [2023-02-13 23:44:20,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2023-02-13 23:44:20,259 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 149 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:44:20,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 97 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:44:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-13 23:44:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-02-13 23:44:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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-13 23:44:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-13 23:44:20,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2023-02-13 23:44:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:44:20,272 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-13 23:44:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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-13 23:44:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-13 23:44:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-13 23:44:20,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:44:20,278 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:44:20,287 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-13 23:44:20,484 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,SelfDestructingSolverStorable3 [2023-02-13 23:44:20,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:44:20,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:44:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash 625081173, now seen corresponding path program 1 times [2023-02-13 23:44:20,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:44:20,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907775651] [2023-02-13 23:44:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:44:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-13 23:44:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:44:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907775651] [2023-02-13 23:44:21,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907775651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:44:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170329221] [2023-02-13 23:44:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:44:21,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:44:21,945 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-13 23:44:21,953 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-13 23:44:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:22,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 69 conjunts are in the unsatisfiable core [2023-02-13 23:44:22,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:44:22,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-13 23:44:22,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:22,265 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 16 treesize of output 17 [2023-02-13 23:44:22,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:22,279 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 16 treesize of output 17 [2023-02-13 23:44:22,293 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-13 23:44:22,293 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-13 23:44:22,300 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-13 23:44:22,376 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-13 23:44:22,377 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-13 23:44:22,384 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-13 23:44:22,397 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-13 23:44:22,398 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-13 23:44:22,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:44:22,658 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-13 23:44:22,674 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-13 23:44:22,675 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 35 [2023-02-13 23:44:22,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:44:22,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2023-02-13 23:44:22,790 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-13 23:44:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-13 23:44:22,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:44:23,985 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.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 ((|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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse45 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse45 .cse4)))))))))) (.cse29 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (= (select (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |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|)))) (.cse30 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse42 .cse4))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.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_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |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|))) .cse3) (or (let ((.cse9 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse25 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse25 .cse4)))))))) (.cse15 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse23 .cse4)))))))) (.cse18 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (= (select (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse5 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse4))))))) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |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 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse4))))) .cse3) .cse9 (or (and (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse10 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse9 (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse11 .cse4))))) (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse13 .cse4))))) .cse15 (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse16 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse16 .cse4))))) .cse18) .cse3) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |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 v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 .cse4))))) .cse3) .cse15 (or .cse3 (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |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 .cse27 .cse2) |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 .cse27 .cse4))))) .cse3) .cse29 .cse30 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse31 .cse4))))))))) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |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 v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 .cse2) |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 .cse33 .cse4))))) .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_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 .cse4))))))) .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_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse37 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse37 .cse4))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int))) (= (select (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |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|))) .cse29 .cse30 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse40 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse40 .cse4)))))))) .cse3)))) is different from false [2023-02-13 23:44:25,078 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse4 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse12 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (= (select (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |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|)))) (.cse13 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse41 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |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 .cse0 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse0 .cse1) |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|)))) .cse3) .cse4 (or .cse3 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse5 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse5 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_396 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse1) |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|))) .cse4 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int))) (= (select (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |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|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 .cse1) |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|))) .cse12 .cse13)) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |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 v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 .cse1) |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|)))) .cse3) .cse12 (or (let ((.cse16 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse36 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse36 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse34 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse34 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse25 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (= (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and .cse16 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse17 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse17 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_396 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse19 (or .cse3 (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |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 .cse21 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse3) (or .cse3 (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |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 v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse25 (or (and (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse16 .cse19 (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse27 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse27 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_396 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse29 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse25) .cse3))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) .cse13 (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_387 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_396 (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_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_396 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_396 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |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|))) .cse3)))) is different from false [2023-02-13 23:44:25,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:44:25,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-13 23:44:25,330 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:44:25,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:44:25,339 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 1184 treesize of output 1142 [2023-02-13 23:44:25,352 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 1126 treesize of output 998 [2023-02-13 23:44:25,367 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 487 treesize of output 455 [2023-02-13 23:44:26,689 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 8 treesize of output 4 [2023-02-13 23:44:26,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:44:26,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-02-13 23:44:26,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:44:26,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:44:26,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:44:26,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2023-02-13 23:44:26,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:26,768 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2023-02-13 23:44:26,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:44:26,785 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-13 23:44:26,792 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:44:26,792 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:44:26,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:44:26,800 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-13 23:44:26,819 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:44:26,820 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 16 treesize of output 8 [2023-02-13 23:44:26,829 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,829 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-13 23:44:26,837 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,838 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-13 23:44:26,844 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,845 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-13 23:44:26,853 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,853 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-13 23:44:26,860 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,860 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-13 23:44:26,867 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,868 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-13 23:44:26,875 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,875 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-13 23:44:26,885 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,886 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-13 23:44:26,895 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,895 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-13 23:44:26,905 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,906 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-13 23:44:26,913 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,914 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-13 23:44:26,921 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-13 23:44:26,921 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-13 23:44:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2023-02-13 23:44:27,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170329221] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:44:27,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:44:27,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2023-02-13 23:44:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160824542] [2023-02-13 23:44:27,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:44:27,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-13 23:44:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:44:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-13 23:44:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=828, Unknown=10, NotChecked=118, Total=1056 [2023-02-13 23:44:27,024 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:44:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:44:29,012 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-02-13 23:44:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-13 23:44:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-13 23:44:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:44:29,015 INFO L225 Difference]: With dead ends: 59 [2023-02-13 23:44:29,015 INFO L226 Difference]: Without dead ends: 57 [2023-02-13 23:44:29,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=374, Invalid=1694, Unknown=10, NotChecked=178, Total=2256 [2023-02-13 23:44:29,017 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 176 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-13 23:44:29,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 113 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 325 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2023-02-13 23:44:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-13 23:44:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2023-02-13 23:44:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-13 23:44:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-02-13 23:44:29,025 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2023-02-13 23:44:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:44:29,025 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-02-13 23:44:29,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:44:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-02-13 23:44:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-13 23:44:29,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:44:29,026 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:44:29,034 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-13 23:44:29,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:44:29,229 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:44:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:44:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2098705484, now seen corresponding path program 1 times [2023-02-13 23:44:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:44:29,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654037376] [2023-02-13 23:44:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:29,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:44:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:44:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:44:29,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654037376] [2023-02-13 23:44:29,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654037376] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:44:29,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11900461] [2023-02-13 23:44:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:29,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:44:29,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:44:29,641 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-13 23:44:29,644 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-13 23:44:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:29,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-13 23:44:29,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:44:29,759 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-13 23:44:29,803 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-13 23:44:29,804 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-13 23:44:29,829 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-13 23:44:29,830 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-13 23:44:29,849 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-13 23:44:29,849 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-13 23:44:29,911 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-13 23:44:29,912 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-13 23:44:29,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:29,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-02-13 23:44:29,989 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-13 23:44:30,083 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-13 23:44:30,084 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-13 23:44:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-13 23:44:30,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:44:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-13 23:44:30,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11900461] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:44:30,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:44:30,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 26 [2023-02-13 23:44:30,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847162159] [2023-02-13 23:44:30,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:44:30,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-13 23:44:30,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:44:30,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-13 23:44:30,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2023-02-13 23:44:30,303 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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-13 23:44:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:44:30,575 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-02-13 23:44:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-13 23:44:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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) Word has length 26 [2023-02-13 23:44:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:44:30,578 INFO L225 Difference]: With dead ends: 50 [2023-02-13 23:44:30,578 INFO L226 Difference]: Without dead ends: 42 [2023-02-13 23:44:30,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2023-02-13 23:44:30,579 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 164 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:44:30,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 163 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:44:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-13 23:44:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2023-02-13 23:44:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-13 23:44:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-13 23:44:30,585 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2023-02-13 23:44:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:44:30,586 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-13 23:44:30,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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-13 23:44:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-13 23:44:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-13 23:44:30,587 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:44:30,587 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:44:30,595 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-13 23:44:30,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:44:30,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:44:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:44:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1184035041, now seen corresponding path program 2 times [2023-02-13 23:44:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:44:30,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4463443] [2023-02-13 23:44:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:44:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:44:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:44:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:44:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:44:32,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4463443] [2023-02-13 23:44:32,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4463443] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:44:32,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141594254] [2023-02-13 23:44:32,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 23:44:32,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:44:32,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:44:32,535 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-13 23:44:32,537 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-13 23:44:32,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 23:44:32,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:44:32,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-13 23:44:32,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:44:32,726 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-13 23:44:32,776 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-13 23:44:32,831 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-13 23:44:32,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-13 23:44:32,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:32,900 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 16 treesize of output 17 [2023-02-13 23:44:32,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-13 23:44:32,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:32,915 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 16 treesize of output 17 [2023-02-13 23:44:33,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:33,048 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-13 23:44:33,049 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 36 treesize of output 39 [2023-02-13 23:44:33,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:33,061 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-13 23:44:33,062 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 28 treesize of output 31 [2023-02-13 23:44:33,084 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-13 23:44:33,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-13 23:44:33,092 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-13 23:44:33,263 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-13 23:44:33,263 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 91 treesize of output 80 [2023-02-13 23:44:33,276 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-13 23:44:33,279 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 44 treesize of output 46 [2023-02-13 23:44:33,303 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-13 23:44:33,304 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-13 23:44:33,915 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2023-02-13 23:44:33,916 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 130 treesize of output 167 [2023-02-13 23:44:33,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:33,928 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-13 23:44:33,928 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 166 treesize of output 125 [2023-02-13 23:44:33,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:44:33,941 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-13 23:44:33,941 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 132 treesize of output 140 [2023-02-13 23:44:34,117 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-13 23:44:34,678 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:44:34,697 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2023-02-13 23:44:34,700 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 130 treesize of output 91 [2023-02-13 23:44:34,713 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-13 23:44:34,714 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 48 treesize of output 50 [2023-02-13 23:44:34,738 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2023-02-13 23:44:34,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 58 [2023-02-13 23:44:34,884 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-13 23:44:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:44:34,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:44:36,067 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_729 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_737 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_735 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse7 .cse3 v_ArrVal_735)) .cse0) .cse4))) (or (= (select (select (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_729)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_734) .cse0 v_ArrVal_740) (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_ArrVal_737)) .cse0) .cse4)) (+ .cse5 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse5))))))) (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_729 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_737 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_735 Int)) (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse14 (select .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse8 (select .cse14 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse12 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse14 .cse3 v_ArrVal_737)) .cse8) .cse12))) (or (= (select (select (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_729)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_734) .cse8 v_ArrVal_740) .cse9) (+ (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse11 .cse3 v_ArrVal_735)) .cse8) .cse12) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse9))))))))) is different from false [2023-02-13 23:44:58,080 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_720 Int) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_729 Int) (v_ArrVal_726 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_737 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_735 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse3 (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_720)))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_726)))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse7 (select .cse6 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse4 (select .cse3 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse2 (select .cse4 0)) (.cse5 (select .cse7 0))) (let ((.cse0 (select (select (store .cse6 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse7 4 v_ArrVal_735)) .cse2) .cse5))) (or (= .cse0 0) (= (select (select (store (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_725))) (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_729))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_734) .cse2 v_ArrVal_740) (select (select (store .cse3 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse4 4 v_ArrVal_737)) .cse2) .cse5)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((v_ArrVal_720 Int) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_729 Int) (v_ArrVal_726 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_737 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_735 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse16 (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_720)))) (store .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse13 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_726)))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse14 (select .cse13 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse17 (select .cse16 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse12 (select .cse17 0)) (.cse15 (select .cse14 0))) (let ((.cse10 (select (select (store .cse16 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse17 4 v_ArrVal_737)) .cse12) .cse15))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse10) (= (select (select (store (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_725))) (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_729))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_734) .cse12 v_ArrVal_740) .cse10) (+ (select (select (store .cse13 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse14 4 v_ArrVal_735)) .cse12) .cse15) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) is different from false [2023-02-13 23:44:59,211 INFO L321 Elim1Store]: treesize reduction 2665, result has 3.1 percent of original size [2023-02-13 23:44:59,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 21915479 treesize of output 21823240 [2023-02-13 23:45:47,824 WARN L233 SmtUtils]: Spent 48.60s on a formula simplification. DAG size of input: 3261 DAG size of output: 3257 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-13 23:45:52,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:45:52,719 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 25792556 treesize of output 23238432 [2023-02-13 23:46:03,011 INFO L321 Elim1Store]: treesize reduction 329, result has 31.6 percent of original size [2023-02-13 23:46:03,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 621274470 treesize of output 620750243