./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:48:46,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:48:46,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:48:46,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:48:46,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:48:46,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:48:46,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:48:46,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:48:46,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:48:46,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:48:46,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:48:46,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:48:46,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:48:46,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:48:46,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:48:46,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:48:46,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:48:46,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:48:46,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:48:46,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:48:46,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:48:46,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:48:46,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:48:46,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:48:46,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:48:46,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:48:46,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:48:46,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:48:46,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:48:46,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:48:46,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:48:46,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:48:46,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:48:46,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:48:46,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:48:46,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:48:46,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:48:46,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:48:46,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:48:46,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:48:46,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:48:46,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:48:46,387 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:48:46,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:48:46,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:48:46,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:48:46,389 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:48:46,389 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:48:46,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:48:46,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:48:46,390 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:48:46,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:48:46,391 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:48:46,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:48:46,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:48:46,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:48:46,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:48:46,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:48:46,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:48:46,392 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:48:46,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:48:46,392 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:48:46,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:48:46,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:48:46,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:48:46,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:48:46,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:48:46,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:48:46,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:48:46,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:48:46,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:48:46,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:48:46,394 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:48:46,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:48:46,394 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:48:46,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:48:46,394 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:48:46,395 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2023-02-15 19:48:46,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:48:46,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:48:46,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:48:46,645 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:48:46,645 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:48:46,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-02-15 19:48:47,710 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:48:47,925 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:48:47,926 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-02-15 19:48:47,936 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0599360f/f777fb23afc04a16bad5dfcb0c6e200b/FLAG092c2961c [2023-02-15 19:48:47,947 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0599360f/f777fb23afc04a16bad5dfcb0c6e200b [2023-02-15 19:48:47,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:48:47,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:48:47,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:48:47,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:48:47,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:48:47,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:48:47" (1/1) ... [2023-02-15 19:48:47,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0e4751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:47, skipping insertion in model container [2023-02-15 19:48:47,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:48:47" (1/1) ... [2023-02-15 19:48:47,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:48:47,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:48:48,205 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-simple/sll2c_prepend_unequal.i[24547,24560] [2023-02-15 19:48:48,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:48:48,221 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:48:48,267 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-simple/sll2c_prepend_unequal.i[24547,24560] [2023-02-15 19:48:48,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:48:48,290 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:48:48,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48 WrapperNode [2023-02-15 19:48:48,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:48:48,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:48:48,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:48:48,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:48:48,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,322 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2023-02-15 19:48:48,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:48:48,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:48:48,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:48:48,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:48:48,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,365 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:48:48,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:48:48,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:48:48,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:48:48,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (1/1) ... [2023-02-15 19:48:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:48:48,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:48,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:48:48,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:48:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:48:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:48:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 19:48:48,455 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 19:48:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:48:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:48:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:48:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:48:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:48:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:48:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:48:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:48:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:48:48,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:48:48,616 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:48:48,618 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:48:48,852 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:48:48,857 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:48:48,857 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:48:48,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:48:48 BoogieIcfgContainer [2023-02-15 19:48:48,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:48:48,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:48:48,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:48:48,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:48:48,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:48:47" (1/3) ... [2023-02-15 19:48:48,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657c0ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:48:48, skipping insertion in model container [2023-02-15 19:48:48,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:48" (2/3) ... [2023-02-15 19:48:48,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657c0ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:48:48, skipping insertion in model container [2023-02-15 19:48:48,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:48:48" (3/3) ... [2023-02-15 19:48:48,872 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-02-15 19:48:48,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:48:48,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:48:48,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:48:48,936 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;@4c0be377, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:48:48,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:48:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:48:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 19:48:48,946 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:48,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:48,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1454169709, now seen corresponding path program 1 times [2023-02-15 19:48:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:48,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825062383] [2023-02-15 19:48:48,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:48:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:48:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:49,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825062383] [2023-02-15 19:48:49,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825062383] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:48:49,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:48:49,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:48:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2472847] [2023-02-15 19:48:49,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:48:49,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:48:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:49,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:48:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:48:49,182 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:48:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:49,236 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2023-02-15 19:48:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:48:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-02-15 19:48:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:49,243 INFO L225 Difference]: With dead ends: 67 [2023-02-15 19:48:49,243 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 19:48:49,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:48:49,247 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:49,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:48:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 19:48:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 19:48:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:48:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-15 19:48:49,272 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-02-15 19:48:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:49,273 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-15 19:48:49,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:48:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-15 19:48:49,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 19:48:49,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:49,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:49,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:48:49,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1579182041, now seen corresponding path program 1 times [2023-02-15 19:48:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:49,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837070722] [2023-02-15 19:48:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:49,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:48:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:48:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:49,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837070722] [2023-02-15 19:48:49,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837070722] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:48:49,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:48:49,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:48:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563583828] [2023-02-15 19:48:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:48:49,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:48:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:49,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:48:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:48:49,430 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:48:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:49,473 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-02-15 19:48:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:48:49,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-02-15 19:48:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:49,475 INFO L225 Difference]: With dead ends: 54 [2023-02-15 19:48:49,475 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 19:48:49,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:48:49,476 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:49,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:48:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 19:48:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-02-15 19:48:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:48:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-02-15 19:48:49,482 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2023-02-15 19:48:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:49,482 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-02-15 19:48:49,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:48:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-02-15 19:48:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 19:48:49,483 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:49,483 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:49,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:48:49,483 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:49,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:49,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1665445247, now seen corresponding path program 1 times [2023-02-15 19:48:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:49,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771914273] [2023-02-15 19:48:49,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:49,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:48:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:48:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:48:50,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:50,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771914273] [2023-02-15 19:48:50,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771914273] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:50,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376890607] [2023-02-15 19:48:50,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:50,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:50,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:48:50,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:48:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:50,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 19:48:50,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:48:50,416 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 17 treesize of output 9 [2023-02-15 19:48:50,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:50,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 19:48:50,518 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 25 treesize of output 13 [2023-02-15 19:48:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:48:50,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:48:50,609 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| Int) (v_ArrVal_316 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| v_ArrVal_316) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2023-02-15 19:48:50,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376890607] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:50,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:48:50,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-02-15 19:48:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501091482] [2023-02-15 19:48:50,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:48:50,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 19:48:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:50,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 19:48:50,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2023-02-15 19:48:50,614 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:48:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:51,032 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-02-15 19:48:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:48:51,033 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2023-02-15 19:48:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:51,034 INFO L225 Difference]: With dead ends: 41 [2023-02-15 19:48:51,034 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 19:48:51,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=788, Unknown=1, NotChecked=58, Total=992 [2023-02-15 19:48:51,035 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 91 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:51,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 201 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:48:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 19:48:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-02-15 19:48:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:48:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-15 19:48:51,039 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 31 [2023-02-15 19:48:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:51,040 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-15 19:48:51,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:48:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-15 19:48:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 19:48:51,043 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:51,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:51,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:48:51,250 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-15 19:48:51,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1631242898, now seen corresponding path program 1 times [2023-02-15 19:48:51,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:51,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339176046] [2023-02-15 19:48:51,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:51,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:48:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:48:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:48:52,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:52,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339176046] [2023-02-15 19:48:52,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339176046] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:52,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77160470] [2023-02-15 19:48:52,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:52,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:52,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:52,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:48:52,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:48:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:52,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 19:48:52,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:48:52,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:48:52,547 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:48:52,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:48:52,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:48:52,678 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:48:52,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 19:48:52,797 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:48:52,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2023-02-15 19:48:52,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:48:52,812 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 7 treesize of output 3 [2023-02-15 19:48:52,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:52,938 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:48:52,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 51 [2023-02-15 19:48:52,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:52,960 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 51 treesize of output 49 [2023-02-15 19:48:52,996 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 19:48:52,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 19:48:53,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-02-15 19:48:53,115 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:48:53,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-15 19:48:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:48:53,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:48:53,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77160470] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:53,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:48:53,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2023-02-15 19:48:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372717999] [2023-02-15 19:48:53,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:48:53,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 19:48:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:53,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 19:48:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 19:48:53,282 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 35 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:54,284 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-02-15 19:48:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:48:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-02-15 19:48:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:54,286 INFO L225 Difference]: With dead ends: 68 [2023-02-15 19:48:54,286 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 19:48:54,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=304, Invalid=2246, Unknown=0, NotChecked=0, Total=2550 [2023-02-15 19:48:54,287 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 117 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:54,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 297 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:48:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 19:48:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2023-02-15 19:48:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2023-02-15 19:48:54,296 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 34 [2023-02-15 19:48:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:54,296 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2023-02-15 19:48:54,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2023-02-15 19:48:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:48:54,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:54,298 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:54,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:48:54,504 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-15 19:48:54,505 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1471122359, now seen corresponding path program 1 times [2023-02-15 19:48:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:54,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196307990] [2023-02-15 19:48:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:48:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:56,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:48:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:48:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:56,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196307990] [2023-02-15 19:48:56,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196307990] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:56,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572726175] [2023-02-15 19:48:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:56,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:56,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:56,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:48:56,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:48:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:56,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 123 conjunts are in the unsatisfiable core [2023-02-15 19:48:56,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:48:56,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:48:56,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:48:56,903 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:48:56,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:48:56,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:48:57,035 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:48:57,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-02-15 19:48:57,163 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-02-15 19:48:57,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2023-02-15 19:48:57,171 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 13 treesize of output 9 [2023-02-15 19:48:57,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:48:57,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:48:57,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:57,354 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:48:57,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 62 [2023-02-15 19:48:57,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:57,364 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 61 treesize of output 59 [2023-02-15 19:48:57,381 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 19:48:57,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 19:48:57,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2023-02-15 19:48:57,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:57,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:57,918 INFO L321 Elim1Store]: treesize reduction 76, result has 29.0 percent of original size [2023-02-15 19:48:57,919 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 144 treesize of output 130 [2023-02-15 19:48:57,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:57,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:57,941 INFO L321 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2023-02-15 19:48:57,941 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 3 case distinctions, treesize of input 72 treesize of output 66 [2023-02-15 19:48:57,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:57,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:57,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 19:48:57,956 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 0 case distinctions, treesize of input 36 treesize of output 29 [2023-02-15 19:48:58,019 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 19:48:58,019 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 41 treesize of output 35 [2023-02-15 19:48:58,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-02-15 19:48:58,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:48:58,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 103 [2023-02-15 19:48:58,613 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:48:58,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 53 [2023-02-15 19:48:58,619 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 7 treesize of output 3 [2023-02-15 19:48:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:48:58,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:02,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_750 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_757) .cse0 v_ArrVal_750) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_753) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_755) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_758) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_754) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2023-02-15 19:49:02,886 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_750 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_757) .cse0 v_ArrVal_750) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_753) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_755) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_758) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_754) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2023-02-15 19:49:02,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_750 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_757) .cse0 v_ArrVal_750) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_753) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_755) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_758) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_754) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2023-02-15 19:49:03,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:03,004 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 2 case distinctions, treesize of input 131 treesize of output 137 [2023-02-15 19:49:03,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:03,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1272 treesize of output 1183 [2023-02-15 19:49:03,043 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 542 treesize of output 450 [2023-02-15 19:49:03,061 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 992 treesize of output 808 [2023-02-15 19:49:07,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572726175] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:07,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:07,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2023-02-15 19:49:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575331] [2023-02-15 19:49:07,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:07,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 19:49:07,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 19:49:07,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1749, Unknown=39, NotChecked=258, Total=2162 [2023-02-15 19:49:07,208 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 41 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:49:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:16,220 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2023-02-15 19:49:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:49:16,220 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-02-15 19:49:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:16,221 INFO L225 Difference]: With dead ends: 67 [2023-02-15 19:49:16,221 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 19:49:16,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=279, Invalid=2997, Unknown=42, NotChecked=342, Total=3660 [2023-02-15 19:49:16,223 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 202 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:16,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 381 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 19:49:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 19:49:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2023-02-15 19:49:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 19:49:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2023-02-15 19:49:16,236 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 36 [2023-02-15 19:49:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:16,237 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2023-02-15 19:49:16,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:49:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2023-02-15 19:49:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:49:16,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:16,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:16,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:49:16,444 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-15 19:49:16,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash 704367666, now seen corresponding path program 1 times [2023-02-15 19:49:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:16,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866256287] [2023-02-15 19:49:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:49:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:49:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:18,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:49:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:49:19,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:19,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866256287] [2023-02-15 19:49:19,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866256287] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:19,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854138683] [2023-02-15 19:49:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:19,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:49:19,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:49:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:19,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-15 19:49:19,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:19,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:49:19,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:49:19,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:19,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 19:49:19,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:19,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:20,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:20,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:20,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:20,232 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:49:20,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-15 19:49:20,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 19:49:20,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:20,525 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:49:20,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-15 19:49:20,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 18 treesize of output 20 [2023-02-15 19:49:20,809 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:49:20,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2023-02-15 19:49:20,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:20,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:20,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 19:49:20,828 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 7 treesize of output 3 [2023-02-15 19:49:20,836 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 7 treesize of output 3 [2023-02-15 19:49:21,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:21,189 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 14 treesize of output 16 [2023-02-15 19:49:21,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:21,222 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:49:21,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2023-02-15 19:49:21,249 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:49:21,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-15 19:49:21,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:49:21,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:21,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:21,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:21,306 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:49:21,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 19:49:22,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2023-02-15 19:49:22,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 91 [2023-02-15 19:49:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,273 INFO L321 Elim1Store]: treesize reduction 119, result has 13.8 percent of original size [2023-02-15 19:49:22,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 85 [2023-02-15 19:49:22,314 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 19:49:22,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 128 [2023-02-15 19:49:22,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2023-02-15 19:49:22,330 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 0 case distinctions, treesize of input 48 treesize of output 41 [2023-02-15 19:49:22,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,356 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 19:49:22,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 164 [2023-02-15 19:49:22,371 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 16 treesize of output 15 [2023-02-15 19:49:22,670 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-15 19:49:22,670 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 66 [2023-02-15 19:49:22,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:22,678 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-15 19:49:22,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:49:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:49:22,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:23,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (let ((.cse3 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_996) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_997)) (.cse0 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_999))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_995) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1001) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_991) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:23,274 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_996) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_997)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_999))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_995) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1001) .cse0 v_ArrVal_991) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:23,299 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse7)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_996) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_997)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_999))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_995) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1001) .cse0 v_ArrVal_991) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:23,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse7)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_996) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_997)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_999))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_995) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1001) .cse0 v_ArrVal_991) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:23,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17| Int) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17| |c_#StackHeapBarrier|)) (= (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17| v_ArrVal_1013))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17| v_ArrVal_1012) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select .cse8 .cse6) .cse7))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17| (store v_ArrVal_1012 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse7)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17| v_ArrVal_996) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_997)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17| (store v_ArrVal_1013 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17|))) .cse0 v_ArrVal_999))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17| v_ArrVal_995) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1001) .cse0 v_ArrVal_991) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))))) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_17|))))) is different from false [2023-02-15 19:49:23,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854138683] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:23,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:23,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-02-15 19:49:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444842250] [2023-02-15 19:49:23,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:23,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 19:49:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 19:49:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2518, Unknown=6, NotChecked=520, Total=3192 [2023-02-15 19:49:23,450 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:49:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:27,854 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2023-02-15 19:49:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 19:49:27,854 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-02-15 19:49:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:27,855 INFO L225 Difference]: With dead ends: 69 [2023-02-15 19:49:27,855 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 19:49:27,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=327, Invalid=4243, Unknown=6, NotChecked=680, Total=5256 [2023-02-15 19:49:27,857 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 156 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:27,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 375 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 19:49:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 19:49:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2023-02-15 19:49:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 19:49:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-02-15 19:49:27,873 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 38 [2023-02-15 19:49:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:27,873 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-02-15 19:49:27,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:49:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-02-15 19:49:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:49:27,875 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:27,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:27,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 19:49:28,081 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-15 19:49:28,081 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2080860260, now seen corresponding path program 2 times [2023-02-15 19:49:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:28,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762373309] [2023-02-15 19:49:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:49:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:28,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:49:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:49:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:49:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:29,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762373309] [2023-02-15 19:49:29,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762373309] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:29,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201839647] [2023-02-15 19:49:29,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:49:29,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:29,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:49:29,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:49:29,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:49:29,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:49:29,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-15 19:49:29,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:29,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:49:29,649 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-15 19:49:29,651 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-15 19:49:29,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:29,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:29,680 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2023-02-15 19:49:29,682 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) |c_#valid|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from true [2023-02-15 19:49:29,746 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 19:49:29,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2023-02-15 19:49:29,760 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 19:49:29,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2023-02-15 19:49:29,776 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 13 treesize of output 11 [2023-02-15 19:49:29,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (or (= (select .cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) (exists ((v_arrayElimCell_102 Int)) (= (select .cse2 v_arrayElimCell_102) |c_ULTIMATE.start_sll_circular_create_#res#1.base|))))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2023-02-15 19:49:29,814 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (store |v_#valid_BEFORE_CALL_16| .cse0 (select |c_#valid| .cse0))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (or (= (select .cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) (exists ((v_arrayElimCell_102 Int)) (= (select .cse2 v_arrayElimCell_102) |c_ULTIMATE.start_sll_circular_create_#res#1.base|))))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2023-02-15 19:49:29,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| |c_ULTIMATE.start_main_~uneq~0#1|) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse3))) (or (= (select .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2)) .cse0) (and (= .cse0 .cse3) (exists ((v_arrayElimCell_102 Int)) (= (select .cse1 v_arrayElimCell_102) .cse0))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (store |v_#valid_BEFORE_CALL_16| .cse4 (select |c_#valid| .cse4))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:49:29,860 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| |c_ULTIMATE.start_main_~uneq~0#1|) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse3))) (or (= (select .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2)) .cse0) (and (= .cse0 .cse3) (exists ((v_arrayElimCell_102 Int)) (= (select .cse1 v_arrayElimCell_102) .cse0))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |c_#valid|))) (store |v_#valid_BEFORE_CALL_16| .cse4 (select |c_#valid| .cse4))) |c_#valid|) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:49:29,914 INFO L321 Elim1Store]: treesize reduction 47, result has 42.0 percent of original size [2023-02-15 19:49:29,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 77 [2023-02-15 19:49:29,926 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:49:29,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2023-02-15 19:49:30,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:30,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:30,216 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 19:49:30,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 97 [2023-02-15 19:49:30,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:30,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:30,233 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:49:30,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 100 [2023-02-15 19:49:30,269 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_18| .cse2))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 0))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (or (= (select .cse3 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse4)) .cse0) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_102 Int)) (= (select .cse3 v_arrayElimCell_102) .cse0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0)))) is different from false [2023-02-15 19:49:30,272 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse2 (select |v_#valid_BEFORE_CALL_18| .cse2))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 0))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (or (= (select .cse3 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse4)) .cse0) (and (= .cse0 .cse1) (exists ((v_arrayElimCell_102 Int)) (= (select .cse3 v_arrayElimCell_102) .cse0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0)))) is different from true [2023-02-15 19:49:30,331 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (or (= (select .cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) .cse1) (and (= .cse1 .cse3) (exists ((v_arrayElimCell_102 Int)) (= (select .cse0 v_arrayElimCell_102) .cse1))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_18| .cse4))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:49:30,335 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (or (= (select .cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) .cse1) (and (= .cse1 .cse3) (exists ((v_arrayElimCell_102 Int)) (= (select .cse0 v_arrayElimCell_102) .cse1))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_18| .cse4))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:49:30,404 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (or (= (select .cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) .cse1) (and (= .cse1 .cse3) (exists ((v_arrayElimCell_102 Int)) (= (select .cse0 v_arrayElimCell_102) .cse1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_18| .cse4))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:49:30,407 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (or (= (select .cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) .cse1) (and (= .cse1 .cse3) (exists ((v_arrayElimCell_102 Int)) (= (select .cse0 v_arrayElimCell_102) .cse1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_18| .cse4))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:49:30,546 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse5))) (or (= (select .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) .cse3) (and (= .cse3 .cse5) (exists ((v_arrayElimCell_102 Int)) (= (select .cse2 v_arrayElimCell_102) .cse3))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_18| .cse6))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:49:30,550 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse5))) (or (= (select .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) .cse3) (and (= .cse3 .cse5) (exists ((v_arrayElimCell_102 Int)) (= (select .cse2 v_arrayElimCell_102) .cse3))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_18| .cse6))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:49:30,629 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse5))) (or (= (select .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) .cse3) (and (= .cse3 .cse5) (exists ((v_arrayElimCell_102 Int)) (= (select .cse2 v_arrayElimCell_102) .cse3))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_18| .cse6))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:49:30,633 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse5))) (or (= (select .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) .cse3) (and (= .cse3 .cse5) (exists ((v_arrayElimCell_102 Int)) (= (select .cse2 v_arrayElimCell_102) .cse3))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_18| .cse6))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:49:30,709 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse5))) (or (= (select .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) .cse3) (and (= .cse3 .cse5) (exists ((v_arrayElimCell_102 Int)) (= (select .cse2 v_arrayElimCell_102) .cse3))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_18| .cse6))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 19:49:30,713 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse5))) (or (= (select .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) .cse3) (and (= .cse3 .cse5) (exists ((v_arrayElimCell_102 Int)) (= (select .cse2 v_arrayElimCell_102) .cse3))))) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_18| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_16| |v_#valid_BEFORE_CALL_18|))) (store |v_#valid_BEFORE_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_18| .cse6))) |v_#valid_BEFORE_CALL_18|) (= 0 (select |v_#valid_BEFORE_CALL_18| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 0))) (<= (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true [2023-02-15 19:49:30,883 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 0 case distinctions, treesize of input 53 treesize of output 55 [2023-02-15 19:49:30,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:30,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:30,959 INFO L321 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2023-02-15 19:49:30,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 1398 treesize of output 882 [2023-02-15 19:49:30,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,084 INFO L321 Elim1Store]: treesize reduction 131, result has 9.7 percent of original size [2023-02-15 19:49:31,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 1592 treesize of output 887 [2023-02-15 19:49:31,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,292 INFO L321 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-02-15 19:49:31,292 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 7 new quantified variables, introduced 7 case distinctions, treesize of input 1460 treesize of output 863 [2023-02-15 19:49:31,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,403 INFO L321 Elim1Store]: treesize reduction 64, result has 28.1 percent of original size [2023-02-15 19:49:31,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 827 treesize of output 555 [2023-02-15 19:49:31,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:49:31,522 INFO L321 Elim1Store]: treesize reduction 102, result has 22.7 percent of original size [2023-02-15 19:49:31,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 181 treesize of output 289 [2023-02-15 19:49:31,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,559 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:49:31,626 INFO L321 Elim1Store]: treesize reduction 90, result has 25.0 percent of original size [2023-02-15 19:49:31,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 318 treesize of output 351 [2023-02-15 19:49:31,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:31,689 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 19:49:31,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 37 [2023-02-15 19:49:31,714 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 31 treesize of output 24 [2023-02-15 19:49:31,733 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 14 treesize of output 13 [2023-02-15 19:49:31,756 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 14 treesize of output 13 [2023-02-15 19:49:31,775 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 20 treesize of output 19 [2023-02-15 19:49:32,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:32,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:32,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 32 [2023-02-15 19:49:32,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:49:32,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:32,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:32,419 INFO L321 Elim1Store]: treesize reduction 186, result has 15.8 percent of original size [2023-02-15 19:49:32,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 504 treesize of output 421 [2023-02-15 19:49:32,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:32,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:32,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2023-02-15 19:49:32,681 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 295 treesize of output 261 [2023-02-15 19:49:33,809 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-02-15 19:49:33,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 511 treesize of output 490 [2023-02-15 19:49:35,467 INFO L321 Elim1Store]: treesize reduction 91, result has 35.9 percent of original size [2023-02-15 19:49:35,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 390 [2023-02-15 19:49:35,766 INFO L321 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2023-02-15 19:49:35,766 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 5 case distinctions, treesize of input 54 treesize of output 21 [2023-02-15 19:50:30,508 WARN L233 SmtUtils]: Spent 51.21s on a formula simplification. DAG size of input: 66 DAG size of output: 24 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-15 19:50:30,509 INFO L321 Elim1Store]: treesize reduction 129, result has 18.4 percent of original size [2023-02-15 19:50:30,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 2686 treesize of output 2531 [2023-02-15 19:50:38,208 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-15 19:50:38,209 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 3 case distinctions, treesize of input 34 treesize of output 19 [2023-02-15 19:50:49,325 WARN L233 SmtUtils]: Spent 11.05s on a formula simplification. DAG size of input: 312 DAG size of output: 117 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-15 19:50:49,326 INFO L321 Elim1Store]: treesize reduction 1148, result has 18.6 percent of original size [2023-02-15 19:50:49,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 12 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 15 new quantified variables, introduced 58 case distinctions, treesize of input 1645 treesize of output 3667