./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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-properties/list_flag-2.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 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:31:39,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:31:39,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:31:39,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:31:39,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:31:39,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:31:39,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:31:39,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:31:39,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:31:39,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:31:39,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:31:39,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:31:39,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:31:39,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:31:39,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:31:39,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:31:39,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:31:39,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:31:39,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:31:39,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:31:39,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:31:39,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:31:39,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:31:39,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:31:39,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:31:39,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:31:39,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:31:39,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:31:39,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:31:39,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:31:39,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:31:39,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:31:39,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:31:39,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:31:39,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:31:39,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:31:39,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:31:39,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:31:39,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:31:39,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:31:39,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:31:39,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:31:39,945 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:31:39,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:31:39,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:31:39,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:31:39,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:31:39,947 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:31:39,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:31:39,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:31:39,948 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:31:39,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:31:39,948 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:31:39,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:31:39,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:31:39,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:31:39,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:31:39,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:31:39,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:31:39,949 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:31:39,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:31:39,950 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:31:39,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:31:39,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:31:39,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:31:39,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:31:39,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:31:39,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:31:39,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:31:39,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:31:39,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:31:39,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:31:39,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:31:39,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:31:39,951 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:31:39,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:31:39,952 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:31:39,952 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 -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2023-02-15 10:31:40,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:31:40,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:31:40,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:31:40,142 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:31:40,142 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:31:40,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2023-02-15 10:31:41,095 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:31:41,295 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:31:41,296 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2023-02-15 10:31:41,305 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c57d27a/4868679473ca41458e0b04a69f1951da/FLAGb023d4f05 [2023-02-15 10:31:41,317 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c57d27a/4868679473ca41458e0b04a69f1951da [2023-02-15 10:31:41,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:31:41,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:31:41,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:31:41,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:31:41,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:31:41,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcb3552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41, skipping insertion in model container [2023-02-15 10:31:41,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:31:41,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:31:41,556 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-properties/list_flag-2.i[23375,23388] [2023-02-15 10:31:41,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:31:41,570 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:31:41,612 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-properties/list_flag-2.i[23375,23388] [2023-02-15 10:31:41,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:31:41,632 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:31:41,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41 WrapperNode [2023-02-15 10:31:41,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:31:41,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:31:41,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:31:41,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:31:41,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,658 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-02-15 10:31:41,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:31:41,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:31:41,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:31:41,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:31:41,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,679 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:31:41,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:31:41,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:31:41,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:31:41,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (1/1) ... [2023-02-15 10:31:41,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:31:41,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:41,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:31:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 10:31:41,733 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 10:31:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:31:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:31:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:31:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:31:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:31:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:31:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:31:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:31:41,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:31:41,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:31:41,843 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:31:41,845 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:31:41,890 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 10:31:41,993 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:31:41,999 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:31:41,999 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 10:31:42,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:42 BoogieIcfgContainer [2023-02-15 10:31:42,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:31:42,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:31:42,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:31:42,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:31:42,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:31:41" (1/3) ... [2023-02-15 10:31:42,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695540f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:42, skipping insertion in model container [2023-02-15 10:31:42,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:41" (2/3) ... [2023-02-15 10:31:42,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695540f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:42, skipping insertion in model container [2023-02-15 10:31:42,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:42" (3/3) ... [2023-02-15 10:31:42,015 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2023-02-15 10:31:42,027 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:31:42,027 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:31:42,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:31:42,066 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;@21041e64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:31:42,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:31:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 10:31:42,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:42,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:42,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 943582971, now seen corresponding path program 1 times [2023-02-15 10:31:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:42,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428576093] [2023-02-15 10:31:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:42,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428576093] [2023-02-15 10:31:42,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428576093] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:42,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:42,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:31:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274060500] [2023-02-15 10:31:42,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:42,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:31:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:31:42,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:31:42,227 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:42,240 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-02-15 10:31:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:31:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 10:31:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:42,245 INFO L225 Difference]: With dead ends: 40 [2023-02-15 10:31:42,245 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 10:31:42,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:31:42,250 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:42,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 10:31:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-15 10:31:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-02-15 10:31:42,271 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2023-02-15 10:31:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:42,271 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-02-15 10:31:42,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-02-15 10:31:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 10:31:42,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:42,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:42,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:31:42,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 267820561, now seen corresponding path program 1 times [2023-02-15 10:31:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:42,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110677667] [2023-02-15 10:31:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:42,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:42,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110677667] [2023-02-15 10:31:42,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110677667] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:42,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:42,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562486672] [2023-02-15 10:31:42,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:42,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:42,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:42,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:42,466 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:42,523 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2023-02-15 10:31:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:31:42,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 10:31:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:42,524 INFO L225 Difference]: With dead ends: 44 [2023-02-15 10:31:42,524 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:31:42,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:31:42,525 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:42,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:31:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2023-02-15 10:31:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-02-15 10:31:42,536 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2023-02-15 10:31:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:42,537 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-02-15 10:31:42,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-02-15 10:31:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 10:31:42,538 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:42,543 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:42,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:31:42,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:42,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash -273802420, now seen corresponding path program 1 times [2023-02-15 10:31:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:42,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730832503] [2023-02-15 10:31:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730832503] [2023-02-15 10:31:42,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730832503] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:42,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:42,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:42,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134892992] [2023-02-15 10:31:42,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:42,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:42,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:42,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:42,659 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:42,707 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-02-15 10:31:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:31:42,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 10:31:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:42,708 INFO L225 Difference]: With dead ends: 46 [2023-02-15 10:31:42,708 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 10:31:42,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:31:42,709 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:42,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 10:31:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2023-02-15 10:31:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-15 10:31:42,713 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2023-02-15 10:31:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:42,713 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-15 10:31:42,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-15 10:31:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 10:31:42,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:42,714 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:42,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:31:42,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1517543941, now seen corresponding path program 1 times [2023-02-15 10:31:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:42,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108229060] [2023-02-15 10:31:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:42,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:42,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108229060] [2023-02-15 10:31:42,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108229060] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:42,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:42,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:42,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63255581] [2023-02-15 10:31:42,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:42,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:42,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:42,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:42,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:42,816 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:42,869 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-02-15 10:31:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:31:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 10:31:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:42,871 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:31:42,871 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:31:42,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:31:42,873 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:42,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:31:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2023-02-15 10:31:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-02-15 10:31:42,879 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2023-02-15 10:31:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:42,880 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-02-15 10:31:42,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-02-15 10:31:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:31:42,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:42,881 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:42,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:31:42,882 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1906655974, now seen corresponding path program 1 times [2023-02-15 10:31:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:42,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881956430] [2023-02-15 10:31:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:42,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:42,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881956430] [2023-02-15 10:31:42,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881956430] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:42,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:42,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:31:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296264452] [2023-02-15 10:31:42,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:42,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:31:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:42,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:31:42,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:31:42,932 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:42,944 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-02-15 10:31:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:31:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:31:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:42,946 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:31:42,946 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 10:31:42,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:31:42,950 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:42,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 10:31:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2023-02-15 10:31:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-02-15 10:31:42,958 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2023-02-15 10:31:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:42,958 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-02-15 10:31:42,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-02-15 10:31:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:31:42,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:42,960 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:42,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:31:42,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:42,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1462919029, now seen corresponding path program 1 times [2023-02-15 10:31:42,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:42,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431619690] [2023-02-15 10:31:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:43,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:43,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431619690] [2023-02-15 10:31:43,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431619690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:43,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138919537] [2023-02-15 10:31:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:43,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:43,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:43,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:31:43,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:31:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:43,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 10:31:43,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:43,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:43,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:43,459 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:43,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:43,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:43,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 10:31:43,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:31:43,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:31:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:43,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:43,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:43,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-15 10:31:43,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:43,691 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 30 treesize of output 33 [2023-02-15 10:31:43,695 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 9 treesize of output 7 [2023-02-15 10:31:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:43,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138919537] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:43,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:43,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-02-15 10:31:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894295997] [2023-02-15 10:31:43,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:43,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 10:31:43,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:43,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 10:31:43,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=301, Unknown=3, NotChecked=0, Total=380 [2023-02-15 10:31:43,787 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:44,051 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-02-15 10:31:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:31:44,051 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:31:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:44,051 INFO L225 Difference]: With dead ends: 59 [2023-02-15 10:31:44,052 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 10:31:44,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=490, Unknown=4, NotChecked=0, Total=650 [2023-02-15 10:31:44,052 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 130 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 31 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:44,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 79 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 134 Invalid, 4 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 10:31:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2023-02-15 10:31:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-02-15 10:31:44,056 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 19 [2023-02-15 10:31:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:44,056 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-02-15 10:31:44,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-02-15 10:31:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:31:44,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:44,056 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:44,064 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-15 10:31:44,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 10:31:44,261 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:44,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1319849960, now seen corresponding path program 1 times [2023-02-15 10:31:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:44,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771729623] [2023-02-15 10:31:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771729623] [2023-02-15 10:31:44,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771729623] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:44,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677135466] [2023-02-15 10:31:44,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:44,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:44,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:44,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:31:44,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:31:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:44,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 10:31:44,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:44,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:44,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:44,585 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:44,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:44,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:44,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 10:31:44,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:31:44,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:31:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:44,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:44,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:44,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-15 10:31:44,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:44,761 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 30 treesize of output 33 [2023-02-15 10:31:44,771 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 9 treesize of output 7 [2023-02-15 10:31:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:44,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677135466] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:44,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:44,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-02-15 10:31:44,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780915162] [2023-02-15 10:31:44,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:44,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 10:31:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 10:31:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=298, Unknown=6, NotChecked=0, Total=380 [2023-02-15 10:31:44,844 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:45,126 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2023-02-15 10:31:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:31:45,127 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:31:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:45,127 INFO L225 Difference]: With dead ends: 59 [2023-02-15 10:31:45,127 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 10:31:45,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=416, Unknown=6, NotChecked=0, Total=552 [2023-02-15 10:31:45,128 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 130 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 35 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:45,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 96 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 169 Invalid, 8 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:31:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 10:31:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2023-02-15 10:31:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-02-15 10:31:45,131 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 19 [2023-02-15 10:31:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:45,131 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-02-15 10:31:45,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-02-15 10:31:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:31:45,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:45,132 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:45,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:45,337 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,SelfDestructingSolverStorable6 [2023-02-15 10:31:45,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:45,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash 876113015, now seen corresponding path program 1 times [2023-02-15 10:31:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:45,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602421301] [2023-02-15 10:31:45,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602421301] [2023-02-15 10:31:45,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602421301] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:45,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:45,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:31:45,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350677466] [2023-02-15 10:31:45,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:45,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:31:45,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:45,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:31:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:31:45,356 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:45,362 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2023-02-15 10:31:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:31:45,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:31:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:45,364 INFO L225 Difference]: With dead ends: 53 [2023-02-15 10:31:45,364 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 10:31:45,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:31:45,365 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:45,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 10:31:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-02-15 10:31:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-15 10:31:45,368 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2023-02-15 10:31:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:45,368 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-15 10:31:45,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-15 10:31:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:31:45,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:45,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:45,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 10:31:45,369 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1445257616, now seen corresponding path program 1 times [2023-02-15 10:31:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:45,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580286482] [2023-02-15 10:31:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580286482] [2023-02-15 10:31:45,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580286482] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:45,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640568006] [2023-02-15 10:31:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:45,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:45,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:45,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:31:45,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:31:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:45,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 10:31:45,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:45,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:45,682 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:45,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:45,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:31:45,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:31:45,736 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:45,737 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 64 treesize of output 61 [2023-02-15 10:31:45,740 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 42 treesize of output 44 [2023-02-15 10:31:45,743 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 29 treesize of output 19 [2023-02-15 10:31:45,764 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 39 treesize of output 21 [2023-02-15 10:31:45,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 10:31:45,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:31:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:45,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:45,795 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 79 treesize of output 57 [2023-02-15 10:31:45,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:45,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 10:31:45,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:45,860 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 36 treesize of output 35 [2023-02-15 10:31:45,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:31:45,874 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:45,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 10:31:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:45,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640568006] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:45,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:45,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-02-15 10:31:45,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389817161] [2023-02-15 10:31:45,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:45,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 10:31:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 10:31:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=251, Unknown=4, NotChecked=0, Total=306 [2023-02-15 10:31:45,951 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:46,140 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-02-15 10:31:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:31:46,141 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 10:31:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:46,141 INFO L225 Difference]: With dead ends: 69 [2023-02-15 10:31:46,141 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 10:31:46,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=400, Unknown=4, NotChecked=0, Total=506 [2023-02-15 10:31:46,142 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 132 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:46,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 134 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 10:31:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2023-02-15 10:31:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-02-15 10:31:46,146 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 21 [2023-02-15 10:31:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:46,147 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-02-15 10:31:46,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-02-15 10:31:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:31:46,147 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:46,148 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:46,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:46,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:46,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1652508907, now seen corresponding path program 2 times [2023-02-15 10:31:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:46,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133721052] [2023-02-15 10:31:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:46,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:46,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133721052] [2023-02-15 10:31:46,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133721052] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:46,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571460345] [2023-02-15 10:31:46,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:31:46,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:46,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:46,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:31:46,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:31:46,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:31:46,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:31:46,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 10:31:46,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:46,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:46,699 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:46,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:46,717 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 13 treesize of output 9 [2023-02-15 10:31:46,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:31:46,749 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:46,749 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 64 treesize of output 61 [2023-02-15 10:31:46,755 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 42 treesize of output 44 [2023-02-15 10:31:46,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-02-15 10:31:46,777 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 39 treesize of output 21 [2023-02-15 10:31:46,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 10:31:46,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:31:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:46,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:46,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2023-02-15 10:31:46,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 10:31:46,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:46,892 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 38 treesize of output 31 [2023-02-15 10:31:46,894 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 11 treesize of output 7 [2023-02-15 10:31:46,905 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:46,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 10:31:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:46,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571460345] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:46,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:46,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-02-15 10:31:46,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496204218] [2023-02-15 10:31:46,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:46,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 10:31:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 10:31:46,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=397, Unknown=2, NotChecked=0, Total=462 [2023-02-15 10:31:46,983 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:47,272 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-02-15 10:31:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:31:47,273 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:31:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:47,273 INFO L225 Difference]: With dead ends: 71 [2023-02-15 10:31:47,273 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 10:31:47,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=760, Unknown=2, NotChecked=0, Total=930 [2023-02-15 10:31:47,274 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 107 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:47,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 130 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 10:31:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2023-02-15 10:31:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-02-15 10:31:47,278 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 23 [2023-02-15 10:31:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:47,278 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-02-15 10:31:47,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-02-15 10:31:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:31:47,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:47,279 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:47,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:47,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:47,484 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1313154078, now seen corresponding path program 1 times [2023-02-15 10:31:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:47,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135202987] [2023-02-15 10:31:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:47,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135202987] [2023-02-15 10:31:47,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135202987] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:47,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241168386] [2023-02-15 10:31:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:47,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:47,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:31:47,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:31:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:47,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 10:31:47,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:47,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:47,807 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:47,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:47,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:31:47,830 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 13 treesize of output 9 [2023-02-15 10:31:47,869 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:47,869 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 64 treesize of output 61 [2023-02-15 10:31:47,872 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 29 treesize of output 19 [2023-02-15 10:31:47,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 10:31:47,896 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 39 treesize of output 21 [2023-02-15 10:31:47,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 10:31:47,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:31:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:47,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:47,953 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 52 treesize of output 30 [2023-02-15 10:31:47,957 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_338 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2023-02-15 10:31:47,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:47,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 10:31:47,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:47,977 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 38 treesize of output 31 [2023-02-15 10:31:47,980 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 11 treesize of output 7 [2023-02-15 10:31:47,991 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:47,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 10:31:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 10:31:48,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241168386] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:48,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:48,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-02-15 10:31:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842230531] [2023-02-15 10:31:48,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:48,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 10:31:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 10:31:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2023-02-15 10:31:48,052 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:48,342 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2023-02-15 10:31:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:31:48,342 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:31:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:48,343 INFO L225 Difference]: With dead ends: 65 [2023-02-15 10:31:48,343 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 10:31:48,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=759, Unknown=2, NotChecked=58, Total=992 [2023-02-15 10:31:48,344 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 115 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:48,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 122 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 176 Invalid, 3 Unknown, 40 Unchecked, 0.1s Time] [2023-02-15 10:31:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 10:31:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2023-02-15 10:31:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-02-15 10:31:48,347 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 23 [2023-02-15 10:31:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:48,347 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-02-15 10:31:48,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-02-15 10:31:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:31:48,348 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:48,348 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:48,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:31:48,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 10:31:48,553 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1574953317, now seen corresponding path program 3 times [2023-02-15 10:31:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:48,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864519701] [2023-02-15 10:31:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:48,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:48,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:48,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864519701] [2023-02-15 10:31:48,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864519701] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:48,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777129527] [2023-02-15 10:31:48,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:31:48,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:48,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:48,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:31:48,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:31:49,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:31:49,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:31:49,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 10:31:49,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:49,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:49,099 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:49,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:31:49,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:49,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:49,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:49,182 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:31:49,183 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 21 treesize of output 25 [2023-02-15 10:31:49,186 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 11 treesize of output 7 [2023-02-15 10:31:49,197 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:49,198 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 22 treesize of output 22 [2023-02-15 10:31:49,284 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:49,285 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 101 treesize of output 92 [2023-02-15 10:31:49,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:49,289 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 41 treesize of output 36 [2023-02-15 10:31:49,293 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 65 treesize of output 51 [2023-02-15 10:31:49,352 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:31:49,352 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 56 treesize of output 56 [2023-02-15 10:31:49,365 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 10:31:49,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2023-02-15 10:31:49,385 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:31:49,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 10:31:49,400 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 15 treesize of output 11 [2023-02-15 10:31:49,420 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 59 treesize of output 47 [2023-02-15 10:31:49,646 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 101 treesize of output 77 [2023-02-15 10:31:49,660 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-02-15 10:31:49,661 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 81 treesize of output 73 [2023-02-15 10:31:49,812 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:49,812 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 22 treesize of output 14 [2023-02-15 10:31:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:49,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:50,368 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2023-02-15 10:31:50,369 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 1963 treesize of output 1863 [2023-02-15 10:31:50,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:50,377 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1761 treesize of output 1544 [2023-02-15 10:32:36,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:32:36,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:32:36,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (let ((.cse4 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse28) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse29) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_9 .cse0) 0))))) .cse10)) (.cse5 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse27) (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse13 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse26)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))))) .cse10)) (.cse3 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse16 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse24)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse6 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse23) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse0) 0))))) (.cse17 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))))) (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse1 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or .cse3 (and .cse4 .cse5 .cse6)) .cse4 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse7) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) .cse5 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 0) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse9 0) (not (= (select v_arrayElimArr_9 .cse0) 0)) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse10)) .cse3) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse11) (= .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_429 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse12) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse10) .cse13 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse14 0) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse15) (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (and .cse13 .cse16 .cse17) .cse3) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_429 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse18) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse16 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse19 0) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse20 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse20) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse10) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse21) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse10) .cse6 .cse17))) is different from false [2023-02-15 10:32:37,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2023-02-15 10:32:37,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,071 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 188 treesize of output 175 [2023-02-15 10:32:37,073 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 160 treesize of output 136 [2023-02-15 10:32:37,076 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 73 treesize of output 61 [2023-02-15 10:32:37,260 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-02-15 10:32:37,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2023-02-15 10:32:37,283 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:37,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 10:32:37,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:37,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-02-15 10:32:37,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 10:32:37,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-02-15 10:32:37,331 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,332 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,342 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 10:32:37,348 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-02-15 10:32:37,352 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,357 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 10:32:37,363 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 10:32:37,368 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 10:32:37,371 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,372 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2023-02-15 10:32:37,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:37,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:37,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 73 [2023-02-15 10:32:37,402 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 34 treesize of output 22 [2023-02-15 10:32:37,425 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,426 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,435 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 10:32:37,438 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,439 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,443 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,450 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-02-15 10:32:37,453 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,454 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,460 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 10:32:37,465 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:32:37,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2023-02-15 10:32:37,469 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,471 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,474 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:32:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-02-15 10:32:37,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777129527] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:32:37,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:32:37,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2023-02-15 10:32:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286530355] [2023-02-15 10:32:37,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:32:37,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 10:32:37,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:32:37,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 10:32:37,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1064, Unknown=8, NotChecked=66, Total=1260 [2023-02-15 10:32:37,637 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:32:45,818 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse15 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (let ((.cse4 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse36) (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse37) (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_9 .cse0) 0))))) .cse15)) (.cse5 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse35) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse18 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse34)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))))) .cse15)) (.cse3 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) .cse20)) (.cse22 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse32 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse32)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse6 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse31) (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse0) 0))))) (.cse23 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))))) (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse1 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or .cse3 (and .cse4 .cse5 .cse6)) (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) .cse4 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse7) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= .cse8 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_425)))) (store .cse11 |v_ULTIMATE.start_main_~p~0#1.base_61| (store (select .cse11 |v_ULTIMATE.start_main_~p~0#1.base_61|) 0 3))))) (let ((.cse9 (select (select .cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 0)) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (or (= .cse9 1) (= 3 .cse9) (not (= (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) .cse5 (= .cse12 0) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse13 0) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse14 0) (not (= (select v_arrayElimArr_9 .cse0) 0)) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse15)) .cse3) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse16) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_429 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse17) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse15) .cse18 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse19 0) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse0) 0)))) (not .cse20) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse21) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (and .cse18 .cse22 .cse23) .cse3) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_429 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse24) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse22 .cse15 (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_426 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 0) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse26) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse15) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_9 .cse0) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse27) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse15) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (not (= (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_429 (Array Int Int))) (let ((.cse29 (select (select .cse28 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_429) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (or (= .cse29 1) (= 3 .cse29))))))) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.offset|) .cse6 .cse23))) is different from false [2023-02-15 10:32:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:32:49,385 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2023-02-15 10:32:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 10:32:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 10:32:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:32:49,386 INFO L225 Difference]: With dead ends: 79 [2023-02-15 10:32:49,386 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 10:32:49,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=337, Invalid=2417, Unknown=10, NotChecked=206, Total=2970 [2023-02-15 10:32:49,387 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 104 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:32:49,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 319 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 484 Invalid, 2 Unknown, 52 Unchecked, 0.4s Time] [2023-02-15 10:32:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 10:32:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2023-02-15 10:32:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:32:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2023-02-15 10:32:49,391 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 27 [2023-02-15 10:32:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:32:49,391 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2023-02-15 10:32:49,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:32:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2023-02-15 10:32:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:32:49,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:32:49,392 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:32:49,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:32:49,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:32:49,597 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:32:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:32:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1961532986, now seen corresponding path program 2 times [2023-02-15 10:32:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:32:49,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431012969] [2023-02-15 10:32:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:32:49,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:32:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:32:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:32:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:32:50,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431012969] [2023-02-15 10:32:50,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431012969] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:32:50,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448104491] [2023-02-15 10:32:50,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:32:50,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:32:50,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:32:50,027 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:32:50,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:32:50,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:32:50,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:32:50,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 10:32:50,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:32:50,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:32:50,164 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:32:50,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 10:32:50,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:32:50,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:32:50,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:32:50,253 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:32:50,253 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 21 treesize of output 25 [2023-02-15 10:32:50,264 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 11 treesize of output 7 [2023-02-15 10:32:50,275 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:32:50,275 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 22 treesize of output 22 [2023-02-15 10:32:50,365 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:32:50,365 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 101 treesize of output 92 [2023-02-15 10:32:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:32:50,371 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 41 treesize of output 36 [2023-02-15 10:32:50,374 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 65 treesize of output 51 [2023-02-15 10:32:50,432 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:32:50,433 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 56 treesize of output 56 [2023-02-15 10:32:50,445 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 10:32:50,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2023-02-15 10:32:50,466 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:32:50,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 10:32:50,473 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 15 treesize of output 11 [2023-02-15 10:32:50,498 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 59 treesize of output 47 [2023-02-15 10:32:50,723 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 101 treesize of output 77 [2023-02-15 10:32:50,739 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-02-15 10:32:50,739 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 81 treesize of output 73 [2023-02-15 10:32:50,898 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:32:50,898 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 22 treesize of output 14 [2023-02-15 10:32:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:32:50,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:32:51,505 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2023-02-15 10:32:51,506 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 2083 treesize of output 1979 [2023-02-15 10:32:51,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:51,533 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1761 treesize of output 1544 [2023-02-15 10:33:15,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:33:15,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:33:15,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:33:15,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:33:15,503 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse13 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) (.cse14 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse30 0) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse2) 0))))) (.cse4 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse29 0) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (.cse5 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_518 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse28 0) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse2) 0))))) (.cse6 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse27 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (not (= (select v_arrayElimArr_23 .cse2) 0))))) (.cse7 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse8 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse26 0) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse9 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse25 0) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse2) 0))))) (.cse10 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse24 0) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse2) 0))))) (.cse11 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse2) 0)))))) (and (or (and (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse0)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse2) 0)))) .cse3 .cse4 .cse5 .cse6) .cse7) .cse8 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse2) 0)))) .cse9 .cse10 .cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse12))))) (not .cse13) (not .cse14)) (or (and .cse13 .cse14) (and (or (and (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse16)))) .cse3 .cse4 .cse5 .cse6 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse17 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse17)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse18)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse2) 0))))) .cse7) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse19)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) .cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse20)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse2) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse22)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse2) 0)))) .cse9 .cse10 .cse11))))) is different from false [2023-02-15 10:33:16,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-02-15 10:33:16,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-02-15 10:33:16,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:33:16,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:33:16,111 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 18 treesize of output 12 [2023-02-15 10:33:16,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:33:16,112 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:33:16,115 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 18 treesize of output 12 [2023-02-15 10:33:16,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 10:33:16,119 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:33:16,119 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 16 treesize of output 8 [2023-02-15 10:33:16,121 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,122 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,123 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,124 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,125 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,127 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,128 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,129 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,130 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,131 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,133 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-02-15 10:33:16,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2023-02-15 10:33:16,152 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:33:16,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-02-15 10:33:16,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:33:16,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 10:33:16,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-02-15 10:33:16,191 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 23 treesize of output 15 [2023-02-15 10:33:16,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2023-02-15 10:33:16,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:33:16,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 73 [2023-02-15 10:33:16,237 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 34 treesize of output 22 [2023-02-15 10:33:16,265 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:33:16,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 10:33:16,272 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:33:16,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 10:33:16,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:16,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2023-02-15 10:33:16,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:33:16,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:33:16,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2023-02-15 10:33:16,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 10:33:16,288 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 22 treesize of output 10 [2023-02-15 10:33:16,289 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,290 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,291 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,292 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,293 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,294 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,295 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,298 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,303 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:33:16,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2023-02-15 10:33:16,306 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:33:16,312 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:33:16,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-02-15 10:33:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-02-15 10:33:16,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448104491] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:33:16,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:33:16,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2023-02-15 10:33:16,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032260477] [2023-02-15 10:33:16,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:33:16,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 10:33:16,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:33:16,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 10:33:16,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1064, Unknown=8, NotChecked=66, Total=1260 [2023-02-15 10:33:16,490 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:33:19,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:33:21,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:33:22,621 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse22 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse16 (not .cse22)) (.cse15 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse4)) (.cse5 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse38 0) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse4) 0))))) (.cse6 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse37 0) (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (.cse7 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_518 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse36 0) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse36 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse4) 0))))) (.cse8 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))) (not (= (select v_arrayElimArr_23 .cse4) 0))))) (.cse10 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse34 0) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (.cse11 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse33 0) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse4) 0))))) (.cse12 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse32 0) (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse4) 0))))) (.cse13 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse4) 0))))) (.cse9 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse2 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse2)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse4) 0)))) .cse5 .cse6 .cse7 .cse8) .cse9) .cse10 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_23 .cse4) 0)))) .cse11 .cse12 .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse14))))) (not .cse15) .cse16) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_513 Int)) (let ((.cse17 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 v_ArrVal_513)))) (store .cse19 |v_ULTIMATE.start_main_~p~0#1.base_71| (store (select .cse19 |v_ULTIMATE.start_main_~p~0#1.base_71|) 0 3))))) (let ((.cse18 (select (select .cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 0)) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (or (not (= (select (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= 3 .cse18) (= 2 .cse18))))) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse21 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (forall ((v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse20 (select (select .cse21 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (or (= .cse20 3) (= .cse20 2)))) (not (= 2 (select (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse16 (or (and .cse15 .cse22) (and (or (and (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse24 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse24)))) .cse5 .cse6 .cse7 .cse8 (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse25)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse26)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (not (= (select v_arrayElimArr_23 .cse4) 0))))) .cse9) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse27)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) .cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse28)))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse4) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_71| Int)) (or (forall ((v_ArrVal_512 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_71| .cse30)))) (forall ((v_ArrVal_518 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~p~0#1.base_71| v_ArrVal_518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_71| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_23 .cse4) 0)))) .cse11 .cse12 .cse13)) .cse9 (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2023-02-15 10:33:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:33:23,734 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-02-15 10:33:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 10:33:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 10:33:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:33:23,734 INFO L225 Difference]: With dead ends: 85 [2023-02-15 10:33:23,735 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 10:33:23,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=331, Invalid=2320, Unknown=9, NotChecked=202, Total=2862 [2023-02-15 10:33:23,736 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 96 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 31 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:33:23,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 355 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 490 Invalid, 3 Unknown, 45 Unchecked, 4.4s Time] [2023-02-15 10:33:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 10:33:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2023-02-15 10:33:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:33:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-02-15 10:33:23,740 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2023-02-15 10:33:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:33:23,740 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-02-15 10:33:23,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:33:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-02-15 10:33:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:33:23,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:33:23,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:33:23,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 10:33:23,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:33:23,950 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:33:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:33:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1736025984, now seen corresponding path program 4 times [2023-02-15 10:33:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:33:23,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943485901] [2023-02-15 10:33:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:33:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:33:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:33:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:33:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:33:24,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943485901] [2023-02-15 10:33:24,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943485901] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:33:24,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298014991] [2023-02-15 10:33:24,543 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:33:24,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:33:24,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:33:24,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:33:24,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:33:24,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:33:24,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:33:24,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-15 10:33:24,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:33:24,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:33:24,681 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:33:24,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 10:33:24,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:33:24,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:33:24,780 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:33:24,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 10:33:24,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:33:24,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:33:24,806 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 10:33:24,806 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 20 treesize of output 22 [2023-02-15 10:33:24,848 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 10:33:24,848 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 1 case distinctions, treesize of input 101 treesize of output 75 [2023-02-15 10:33:24,852 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 100 treesize of output 82 [2023-02-15 10:33:24,920 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 10:33:24,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 117 [2023-02-15 10:33:24,934 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 10:33:24,935 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 114 treesize of output 112 [2023-02-15 10:33:24,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2023-02-15 10:33:25,038 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 10:33:25,038 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 118 treesize of output 49 [2023-02-15 10:33:25,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 16 [2023-02-15 10:33:25,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:33:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:33:25,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:33:25,101 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 187 treesize of output 129 [2023-02-15 10:33:25,109 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_607))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_606))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))) is different from false [2023-02-15 10:33:25,133 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_79| Int)) (= (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_606))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_79|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~t~0#1.base|)) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_79| Int)) (= |v_ULTIMATE.start_main_~p~0#1.offset_79| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_79|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_607))) (select (select .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))))) is different from false [2023-02-15 10:33:25,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,220 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2023-02-15 10:33:25,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,224 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2023-02-15 10:33:25,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,236 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2023-02-15 10:33:25,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,241 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2023-02-15 10:33:25,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2023-02-15 10:33:25,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2023-02-15 10:33:25,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2642 treesize of output 1799 [2023-02-15 10:33:25,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,438 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 10138 treesize of output 9495 [2023-02-15 10:33:25,447 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 9480 treesize of output 8616 [2023-02-15 10:33:25,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8626 treesize of output 5854 [2023-02-15 10:33:25,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 5446 treesize of output 5348 [2023-02-15 10:33:25,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:33:25,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 5294 treesize of output 5242