./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 b5317dae 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-?-b5317da-m [2023-02-16 01:08:32,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:08:32,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:08:32,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:08:32,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:08:32,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:08:32,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:08:32,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:08:32,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:08:32,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:08:32,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:08:32,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:08:32,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:08:32,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:08:32,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:08:32,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:08:32,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:08:32,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:08:32,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:08:32,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:08:32,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:08:32,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:08:32,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:08:32,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:08:32,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:08:32,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:08:32,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:08:32,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:08:32,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:08:32,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:08:32,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:08:32,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:08:32,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:08:32,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:08:32,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:08:32,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:08:32,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:08:32,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:08:33,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:08:33,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:08:33,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:08:33,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:08:33,017 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:08:33,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:08:33,017 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:08:33,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:08:33,018 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:08:33,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:08:33,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:08:33,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:08:33,019 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:08:33,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:08:33,020 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:08:33,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:08:33,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:08:33,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:08:33,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:08:33,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:08:33,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:08:33,024 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:08:33,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:08:33,024 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:08:33,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:08:33,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:08:33,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:08:33,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:08:33,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:08:33,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:08:33,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:08:33,026 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:08:33,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:08:33,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:08:33,027 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:08:33,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:08:33,027 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:08:33,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:08:33,028 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:08:33,028 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-16 01:08:33,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:08:33,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:08:33,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:08:33,251 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:08:33,251 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:08:33,252 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-16 01:08:34,352 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:08:34,556 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:08:34,557 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-02-16 01:08:34,564 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1cf011a/9493dd1ec0464a868c512381f0c77bb3/FLAGfe753ab21 [2023-02-16 01:08:34,573 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1cf011a/9493dd1ec0464a868c512381f0c77bb3 [2023-02-16 01:08:34,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:08:34,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:08:34,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:08:34,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:08:34,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:08:34,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a805ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34, skipping insertion in model container [2023-02-16 01:08:34,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:08:34,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:08:34,810 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-16 01:08:34,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:08:34,819 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:08:34,848 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-16 01:08:34,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:08:34,880 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:08:34,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34 WrapperNode [2023-02-16 01:08:34,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:08:34,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:08:34,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:08:34,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:08:34,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,936 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2023-02-16 01:08:34,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:08:34,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:08:34,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:08:34,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:08:34,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,977 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:08:34,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:08:34,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:08:34,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:08:34,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (1/1) ... [2023-02-16 01:08:34,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:08:35,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:35,014 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-16 01:08:35,045 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-16 01:08:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:08:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:08:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 01:08:35,057 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 01:08:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 01:08:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:08:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:08:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 01:08:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 01:08:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:08:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 01:08:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:08:35,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:08:35,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:08:35,187 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:08:35,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:08:35,375 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:08:35,379 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:08:35,383 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 01:08:35,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:08:35 BoogieIcfgContainer [2023-02-16 01:08:35,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:08:35,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:08:35,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:08:35,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:08:35,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:08:34" (1/3) ... [2023-02-16 01:08:35,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df76c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:08:35, skipping insertion in model container [2023-02-16 01:08:35,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:08:34" (2/3) ... [2023-02-16 01:08:35,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df76c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:08:35, skipping insertion in model container [2023-02-16 01:08:35,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:08:35" (3/3) ... [2023-02-16 01:08:35,391 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-02-16 01:08:35,403 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:08:35,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:08:35,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:08:35,442 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;@39ad28c9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:08:35,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:08:35,445 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-16 01:08:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 01:08:35,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:35,451 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-16 01:08:35,452 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1454169709, now seen corresponding path program 1 times [2023-02-16 01:08:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:35,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695628126] [2023-02-16 01:08:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:35,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:08:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:35,747 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-16 01:08:35,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:35,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695628126] [2023-02-16 01:08:35,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695628126] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:08:35,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:08:35,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:08:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598709651] [2023-02-16 01:08:35,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:08:35,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:08:35,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:35,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:08:35,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:08:35,787 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-16 01:08:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:35,850 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2023-02-16 01:08:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:08:35,852 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-16 01:08:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:35,856 INFO L225 Difference]: With dead ends: 67 [2023-02-16 01:08:35,857 INFO L226 Difference]: Without dead ends: 29 [2023-02-16 01:08:35,859 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-16 01:08:35,863 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-16 01:08:35,864 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-16 01:08:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-16 01:08:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-16 01:08:35,884 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-16 01:08:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-16 01:08:35,886 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-02-16 01:08:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:35,887 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-16 01:08:35,887 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-16 01:08:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-16 01:08:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 01:08:35,888 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:35,888 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-16 01:08:35,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:08:35,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1579182041, now seen corresponding path program 1 times [2023-02-16 01:08:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:35,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345758332] [2023-02-16 01:08:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:08:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:36,034 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-16 01:08:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:36,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345758332] [2023-02-16 01:08:36,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345758332] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:08:36,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:08:36,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:08:36,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338593016] [2023-02-16 01:08:36,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:08:36,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:08:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:36,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:08:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:08:36,049 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-16 01:08:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:36,097 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-02-16 01:08:36,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:08:36,097 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-16 01:08:36,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:36,099 INFO L225 Difference]: With dead ends: 54 [2023-02-16 01:08:36,099 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 01:08:36,099 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-16 01:08:36,100 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-16 01:08:36,101 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-16 01:08:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 01:08:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-02-16 01:08:36,105 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-16 01:08:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-02-16 01:08:36,107 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2023-02-16 01:08:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:36,108 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-02-16 01:08:36,108 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-16 01:08:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-02-16 01:08:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 01:08:36,109 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:36,110 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-16 01:08:36,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:08:36,110 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:36,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1665445247, now seen corresponding path program 1 times [2023-02-16 01:08:36,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:36,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443591156] [2023-02-16 01:08:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:36,656 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-16 01:08:36,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:36,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443591156] [2023-02-16 01:08:36,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443591156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:36,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215530520] [2023-02-16 01:08:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:36,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:36,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:36,663 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-16 01:08:36,664 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-16 01:08:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:36,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-16 01:08:36,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:37,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-16 01:08:37,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:37,089 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-16 01:08:37,122 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-16 01:08:37,142 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-16 01:08:37,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:37,239 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-16 01:08:37,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215530520] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:37,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:37,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-02-16 01:08:37,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550485139] [2023-02-16 01:08:37,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:37,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 01:08:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:37,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 01:08:37,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2023-02-16 01:08:37,246 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-16 01:08:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:37,691 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-02-16 01:08:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 01:08:37,692 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-16 01:08:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:37,692 INFO L225 Difference]: With dead ends: 41 [2023-02-16 01:08:37,692 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 01:08:37,693 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-16 01:08:37,694 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-16 01:08:37,694 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-16 01:08:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 01:08:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-02-16 01:08:37,698 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-16 01:08:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-16 01:08:37,698 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 31 [2023-02-16 01:08:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:37,698 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-16 01:08:37,698 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-16 01:08:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-16 01:08:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 01:08:37,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:37,699 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-16 01:08:37,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:37,905 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-16 01:08:37,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:37,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1631242898, now seen corresponding path program 1 times [2023-02-16 01:08:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:37,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886515308] [2023-02-16 01:08:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:38,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:38,710 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-16 01:08:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:38,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886515308] [2023-02-16 01:08:38,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886515308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:38,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247031674] [2023-02-16 01:08:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:38,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:38,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:38,718 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-16 01:08:38,720 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-16 01:08:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:38,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-16 01:08:38,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:38,874 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-16 01:08:39,030 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:39,031 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-16 01:08:39,082 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-16 01:08:39,149 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:08:39,149 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-16 01:08:39,267 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:08:39,268 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-16 01:08:39,277 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-16 01:08:39,282 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-16 01:08:39,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:39,386 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:39,389 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-16 01:08:39,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:39,395 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-16 01:08:39,416 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-16 01:08:39,416 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-16 01:08:39,489 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-16 01:08:39,528 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:08:39,528 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-16 01:08:39,552 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-16 01:08:39,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:39,699 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| v_ArrVal_532))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| v_ArrVal_533) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11|))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| |c_#StackHeapBarrier|)))) is different from false [2023-02-16 01:08:39,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247031674] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:39,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:39,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2023-02-16 01:08:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473509362] [2023-02-16 01:08:39,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:39,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-16 01:08:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:39,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-16 01:08:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1214, Unknown=1, NotChecked=70, Total=1406 [2023-02-16 01:08:39,702 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-16 01:08:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:40,783 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-02-16 01:08:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 01:08:40,784 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-16 01:08:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:40,784 INFO L225 Difference]: With dead ends: 68 [2023-02-16 01:08:40,785 INFO L226 Difference]: Without dead ends: 58 [2023-02-16 01:08:40,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=295, Invalid=2158, Unknown=1, NotChecked=96, Total=2550 [2023-02-16 01:08:40,786 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 117 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-16 01:08:40,786 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-16 01:08:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-16 01:08:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2023-02-16 01:08:40,793 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-16 01:08:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2023-02-16 01:08:40,794 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 34 [2023-02-16 01:08:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:40,795 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2023-02-16 01:08:40,795 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-16 01:08:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2023-02-16 01:08:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 01:08:40,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:40,796 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-16 01:08:40,807 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-16 01:08:41,001 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-16 01:08:41,002 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1471122359, now seen corresponding path program 1 times [2023-02-16 01:08:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:41,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866779583] [2023-02-16 01:08:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:42,918 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-16 01:08:42,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:42,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866779583] [2023-02-16 01:08:42,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866779583] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:42,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34052084] [2023-02-16 01:08:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:42,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:42,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:42,921 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-16 01:08:42,923 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-16 01:08:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:43,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 123 conjunts are in the unsatisfiable core [2023-02-16 01:08:43,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:43,083 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-16 01:08:43,238 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-16 01:08:43,339 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:43,339 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-16 01:08:43,394 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-16 01:08:43,475 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:08:43,476 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-16 01:08:43,598 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-02-16 01:08:43,598 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-16 01:08:43,603 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-16 01:08:43,608 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-16 01:08:43,687 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-16 01:08:43,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:43,768 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:43,769 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-16 01:08:43,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:43,777 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-16 01:08:43,794 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-16 01:08:43,794 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-16 01:08:44,235 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-16 01:08:44,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:44,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:44,277 INFO L321 Elim1Store]: treesize reduction 76, result has 29.0 percent of original size [2023-02-16 01:08:44,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 144 treesize of output 130 [2023-02-16 01:08:44,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:44,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:44,299 INFO L321 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2023-02-16 01:08:44,300 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-16 01:08:44,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:44,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:44,308 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-16 01:08:44,314 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-16 01:08:44,331 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 01:08:44,363 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 01:08:44,365 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-16 01:08:44,383 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-16 01:08:54,669 WARN L233 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 72 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:08:54,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:54,703 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-16 01:08:54,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:08:54,708 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-16 01:08:54,712 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-16 01:08:54,742 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-16 01:08:54,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:54,808 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))) (= (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) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| 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|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| 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|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| 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-16 01:08:58,828 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-16 01:08:58,841 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-16 01:08:58,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:58,926 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-16 01:08:58,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:58,942 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-16 01:08:58,959 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-16 01:08:58,971 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-16 01:09:07,104 WARN L233 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:09:07,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34052084] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:07,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:09:07,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2023-02-16 01:09:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500448979] [2023-02-16 01:09:07,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:09:07,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-16 01:09:07,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:09:07,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-16 01:09:07,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1764, Unknown=24, NotChecked=258, Total=2162 [2023-02-16 01:09:07,108 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-16 01:09:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:09:15,666 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2023-02-16 01:09:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 01:09:15,667 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-16 01:09:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:09:15,667 INFO L225 Difference]: With dead ends: 67 [2023-02-16 01:09:15,667 INFO L226 Difference]: Without dead ends: 65 [2023-02-16 01:09:15,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=276, Invalid=3018, Unknown=24, NotChecked=342, Total=3660 [2023-02-16 01:09:15,669 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 202 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.6s IncrementalHoareTripleChecker+Time [2023-02-16 01:09:15,669 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.6s Time] [2023-02-16 01:09:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-16 01:09:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2023-02-16 01:09:15,678 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-16 01:09:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2023-02-16 01:09:15,679 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 36 [2023-02-16 01:09:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:09:15,679 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2023-02-16 01:09:15,679 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-16 01:09:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2023-02-16 01:09:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:09:15,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:09:15,680 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-16 01:09:15,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-16 01:09:15,887 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-16 01:09:15,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:09:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:09:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash 704367666, now seen corresponding path program 1 times [2023-02-16 01:09:15,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:09:15,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035234115] [2023-02-16 01:09:15,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:15,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:09:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:09:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:09:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:09:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:18,463 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-16 01:09:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:09:18,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035234115] [2023-02-16 01:09:18,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035234115] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:18,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201996253] [2023-02-16 01:09:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:18,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:18,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:09:18,465 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-16 01:09:18,467 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-16 01:09:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:18,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-16 01:09:18,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:09:18,642 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-16 01:09:18,707 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-16 01:09:18,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:18,840 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-16 01:09:19,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:19,029 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-16 01:09:19,106 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-16 01:09:19,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:19,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:19,201 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:09:19,202 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-16 01:09:19,309 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-16 01:09:19,324 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-16 01:09:19,465 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:09:19,466 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-16 01:09:19,479 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-16 01:09:19,717 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:09:19,717 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-16 01:09:19,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:19,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:19,730 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-16 01:09:19,733 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-16 01:09:19,739 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-16 01:09:20,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,010 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-16 01:09:20,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,034 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:09:20,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2023-02-16 01:09:20,052 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 01:09:20,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-16 01:09:20,058 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-16 01:09:20,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,089 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:09:20,090 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-16 01:09:20,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,738 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-16 01:09:20,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,748 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-16 01:09:20,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,800 INFO L321 Elim1Store]: treesize reduction 119, result has 13.8 percent of original size [2023-02-16 01:09:20,801 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-16 01:09:20,834 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 01:09:20,834 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-16 01:09:20,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,842 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-16 01:09:20,848 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-16 01:09:20,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:20,869 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-16 01:09:20,870 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-16 01:09:20,882 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-16 01:09:21,154 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-16 01:09:21,154 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-16 01:09:21,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:21,161 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-16 01:09:21,236 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-16 01:09:21,296 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-16 01:09:21,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:09:21,513 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-16 01:09:21,542 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-16 01:09:21,568 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-16 01:09:21,581 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-16 01:09:21,681 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-16 01:09:21,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201996253] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:21,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:09:21,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-02-16 01:09:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347786558] [2023-02-16 01:09:21,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:09:21,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-16 01:09:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:09:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-16 01:09:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2517, Unknown=7, NotChecked=520, Total=3192 [2023-02-16 01:09:21,687 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-16 01:09:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:09:25,348 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2023-02-16 01:09:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 01:09:25,348 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-16 01:09:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:09:25,349 INFO L225 Difference]: With dead ends: 69 [2023-02-16 01:09:25,349 INFO L226 Difference]: Without dead ends: 67 [2023-02-16 01:09:25,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=327, Invalid=4242, Unknown=7, NotChecked=680, Total=5256 [2023-02-16 01:09:25,350 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 156 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:09:25,351 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.3s Time] [2023-02-16 01:09:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-16 01:09:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2023-02-16 01:09:25,360 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-16 01:09:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-02-16 01:09:25,361 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 38 [2023-02-16 01:09:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:09:25,361 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-02-16 01:09:25,361 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-16 01:09:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-02-16 01:09:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:09:25,362 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:09:25,362 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-16 01:09:25,367 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-16 01:09:25,567 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-16 01:09:25,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:09:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:09:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2080860260, now seen corresponding path program 2 times [2023-02-16 01:09:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:09:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120551964] [2023-02-16 01:09:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:09:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:09:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:26,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:09:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:26,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:09:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:09:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:09:26,536 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-16 01:09:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:09:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120551964] [2023-02-16 01:09:26,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120551964] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:09:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376391840] [2023-02-16 01:09:26,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:09:26,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:09:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:09:26,570 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-16 01:09:26,571 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-16 01:09:26,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:09:26,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:09:26,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-16 01:09:26,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:09:26,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:09:26,923 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-16 01:09:26,926 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-16 01:09:26,946 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-16 01:09:26,955 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-16 01:09:26,969 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-16 01:09:26,971 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-16 01:09:27,014 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 01:09:27,014 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-16 01:09:27,028 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-16 01:09:27,029 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-16 01:09:27,033 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-16 01:09:27,054 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-16 01:09:27,057 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-16 01:09:27,091 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-16 01:09:27,093 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-16 01:09:27,133 INFO L321 Elim1Store]: treesize reduction 47, result has 42.0 percent of original size [2023-02-16 01:09:27,133 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-16 01:09:27,142 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:09:27,142 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-16 01:09:27,237 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-16 01:09:27,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:27,345 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-16 01:09:27,345 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-16 01:09:27,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:27,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:27,357 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:09:27,357 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-16 01:09:27,386 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-16 01:09:27,388 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-16 01:09:27,426 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-16 01:09:27,429 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-16 01:09:27,476 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-16 01:09:27,479 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-16 01:09:27,585 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-16 01:09:27,589 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-16 01:09:27,650 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-16 01:09:27,653 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-16 01:09:27,716 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-16 01:09:27,718 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-16 01:09:27,854 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-16 01:09:27,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:27,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:27,901 INFO L321 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2023-02-16 01:09:27,901 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-16 01:09:27,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,020 INFO L321 Elim1Store]: treesize reduction 131, result has 9.7 percent of original size [2023-02-16 01:09:28,021 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-16 01:09:28,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,182 INFO L321 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-02-16 01:09:28,183 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-16 01:09:28,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,284 INFO L321 Elim1Store]: treesize reduction 64, result has 28.1 percent of original size [2023-02-16 01:09:28,285 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-16 01:09:28,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,335 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:28,402 INFO L321 Elim1Store]: treesize reduction 102, result has 22.7 percent of original size [2023-02-16 01:09:28,402 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-16 01:09:28,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,428 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:28,484 INFO L321 Elim1Store]: treesize reduction 90, result has 25.0 percent of original size [2023-02-16 01:09:28,484 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-16 01:09:28,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:28,546 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-16 01:09:28,547 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-16 01:09:28,573 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-16 01:09:28,596 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-16 01:09:28,620 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-16 01:09:28,646 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-16 01:09:29,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,022 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-16 01:09:29,032 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-16 01:09:29,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,299 INFO L321 Elim1Store]: treesize reduction 186, result has 15.8 percent of original size [2023-02-16 01:09:29,299 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-16 01:09:29,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:29,556 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 92 treesize of output 87 [2023-02-16 01:09:29,597 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-16 01:09:30,382 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-02-16 01:09:30,382 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-16 01:09:31,169 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2023-02-16 01:09:31,170 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 317 treesize of output 345 [2023-02-16 01:09:31,556 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-16 01:09:31,556 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 53 treesize of output 21 [2023-02-16 01:09:32,586 INFO L321 Elim1Store]: treesize reduction 167, result has 36.3 percent of original size [2023-02-16 01:09:32,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 332 treesize of output 431 [2023-02-16 01:09:37,691 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:37,701 INFO L321 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2023-02-16 01:09:37,701 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 7 case distinctions, treesize of input 65 treesize of output 33 [2023-02-16 01:09:38,053 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:38,055 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:38,066 INFO L321 Elim1Store]: treesize reduction 51, result has 5.6 percent of original size [2023-02-16 01:09:38,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 33 [2023-02-16 01:09:38,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:38,110 INFO L321 Elim1Store]: treesize reduction 39, result has 7.1 percent of original size [2023-02-16 01:09:38,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 33 [2023-02-16 01:09:38,348 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:38,358 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2023-02-16 01:09:38,358 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 3 case distinctions, treesize of input 65 treesize of output 33 [2023-02-16 01:09:38,807 INFO L321 Elim1Store]: treesize reduction 420, result has 22.1 percent of original size [2023-02-16 01:09:38,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 135 treesize of output 258 [2023-02-16 01:09:42,173 INFO L321 Elim1Store]: treesize reduction 1928, result has 6.6 percent of original size [2023-02-16 01:09:42,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 60 case distinctions, treesize of input 388 treesize of output 938 [2023-02-16 01:09:43,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:43,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:43,822 INFO L321 Elim1Store]: treesize reduction 177, result has 0.6 percent of original size [2023-02-16 01:09:43,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 139 treesize of output 28 [2023-02-16 01:09:43,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:43,995 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,017 INFO L321 Elim1Store]: treesize reduction 208, result has 0.5 percent of original size [2023-02-16 01:09:44,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 18 case distinctions, treesize of input 139 treesize of output 28 [2023-02-16 01:09:44,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,487 INFO L321 Elim1Store]: treesize reduction 177, result has 0.6 percent of original size [2023-02-16 01:09:44,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 139 treesize of output 28 [2023-02-16 01:09:44,538 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,551 INFO L321 Elim1Store]: treesize reduction 185, result has 0.5 percent of original size [2023-02-16 01:09:44,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 139 treesize of output 28 [2023-02-16 01:09:44,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,647 INFO L321 Elim1Store]: treesize reduction 208, result has 0.5 percent of original size [2023-02-16 01:09:44,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 18 case distinctions, treesize of input 139 treesize of output 28 [2023-02-16 01:09:44,671 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,671 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:44,682 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-02-16 01:09:44,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 139 treesize of output 28 [2023-02-16 01:09:45,512 INFO L321 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2023-02-16 01:09:45,512 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-16 01:09:45,644 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:45,650 INFO L321 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2023-02-16 01:09:45,651 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 7 case distinctions, treesize of input 59 treesize of output 24 [2023-02-16 01:09:45,798 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-16 01:09:45,799 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 3 case distinctions, treesize of input 59 treesize of output 24 [2023-02-16 01:09:45,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 24 [2023-02-16 01:09:46,059 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-16 01:09:46,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 59 treesize of output 24 [2023-02-16 01:09:46,402 INFO L321 Elim1Store]: treesize reduction 420, result has 22.1 percent of original size [2023-02-16 01:09:46,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 142 treesize of output 265 [2023-02-16 01:09:49,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:49,492 INFO L321 Elim1Store]: treesize reduction 146, result has 0.7 percent of original size [2023-02-16 01:09:49,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 32 [2023-02-16 01:09:49,708 INFO L321 Elim1Store]: treesize reduction 695, result has 9.5 percent of original size [2023-02-16 01:09:49,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 31 case distinctions, treesize of input 199 treesize of output 274 [2023-02-16 01:09:49,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:49,877 INFO L321 Elim1Store]: treesize reduction 323, result has 0.3 percent of original size [2023-02-16 01:09:49,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 150 treesize of output 37 [2023-02-16 01:09:50,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,127 INFO L321 Elim1Store]: treesize reduction 118, result has 0.8 percent of original size [2023-02-16 01:09:50,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 97 treesize of output 34 [2023-02-16 01:09:50,260 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,317 INFO L321 Elim1Store]: treesize reduction 242, result has 16.8 percent of original size [2023-02-16 01:09:50,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 159 treesize of output 209 [2023-02-16 01:09:50,368 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,377 INFO L321 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2023-02-16 01:09:50,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 127 treesize of output 23 [2023-02-16 01:09:50,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:50,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,428 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,433 INFO L321 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-02-16 01:09:50,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 29 [2023-02-16 01:09:50,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:09:50,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:50,504 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 01:09:50,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 23 [2023-02-16 01:09:50,744 INFO L321 Elim1Store]: treesize reduction 695, result has 9.5 percent of original size [2023-02-16 01:09:50,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 31 case distinctions, treesize of input 199 treesize of output 274 [2023-02-16 01:09:51,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:51,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:09:51,097 INFO L321 Elim1Store]: treesize reduction 279, result has 0.4 percent of original size [2023-02-16 01:09:51,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 150 treesize of output 37 [2023-02-16 01:09:51,296 INFO L321 Elim1Store]: treesize reduction 68, result has 12.8 percent of original size [2023-02-16 01:09:51,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 34