./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list-1.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-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:31:25,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:31:25,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:31:25,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:31:25,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:31:25,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:31:25,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:31:25,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:31:25,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:31:25,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:31:25,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:31:25,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:31:25,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:31:25,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:31:25,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:31:25,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:31:25,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:31:25,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:31:25,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:31:25,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:31:25,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:31:25,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:31:25,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:31:25,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:31:25,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:31:25,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:31:25,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:31:25,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:31:25,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:31:25,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:31:25,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:31:25,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:31:25,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:31:25,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:31:25,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:31:25,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:31:25,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:31:25,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:31:25,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:31:25,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:31:25,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:31:25,750 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:25,784 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:31:25,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:31:25,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:31:25,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:31:25,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:31:25,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:31:25,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:31:25,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:31:25,788 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:31:25,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:31:25,788 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:31:25,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:31:25,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:31:25,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:31:25,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:31:25,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:31:25,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:31:25,790 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:31:25,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:31:25,790 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:31:25,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:31:25,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:31:25,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:31:25,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:31:25,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:31:25,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:31:25,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:31:25,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:31:25,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:31:25,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:31:25,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:31:25,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:31:25,792 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:31:25,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:31:25,793 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:31:25,793 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 -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2023-02-15 10:31:26,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:31:26,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:31:26,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:31:26,061 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:31:26,062 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:31:26,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2023-02-15 10:31:27,115 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:31:27,375 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:31:27,375 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2023-02-15 10:31:27,385 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d465f71a5/40ea0a37e4ff47c0af52a5920788b48a/FLAG9470d1b03 [2023-02-15 10:31:27,395 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d465f71a5/40ea0a37e4ff47c0af52a5920788b48a [2023-02-15 10:31:27,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:31:27,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:31:27,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:31:27,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:31:27,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:31:27,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:27" (1/1) ... [2023-02-15 10:31:27,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3b4741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:27, skipping insertion in model container [2023-02-15 10:31:27,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:31:27" (1/1) ... [2023-02-15 10:31:27,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:31:27,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:31:27,743 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-1.i[23408,23421] [2023-02-15 10:31:27,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:31:27,760 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:31:27,788 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-1.i[23408,23421] [2023-02-15 10:31:27,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:31:27,808 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:31:27,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:27 WrapperNode [2023-02-15 10:31:27,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:31:27,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:31:27,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:31:27,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:31:27,816 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:27" (1/1) ... [2023-02-15 10:31:27,827 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:27" (1/1) ... [2023-02-15 10:31:27,842 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-02-15 10:31:27,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:31:27,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:31:27,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:31:27,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:31:27,850 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:27" (1/1) ... [2023-02-15 10:31:27,850 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:27" (1/1) ... [2023-02-15 10:31:27,854 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:27" (1/1) ... [2023-02-15 10:31:27,854 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:27" (1/1) ... [2023-02-15 10:31:27,866 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:27" (1/1) ... [2023-02-15 10:31:27,869 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:27" (1/1) ... [2023-02-15 10:31:27,870 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:27" (1/1) ... [2023-02-15 10:31:27,871 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:27" (1/1) ... [2023-02-15 10:31:27,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:31:27,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:31:27,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:31:27,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:31:27,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:27" (1/1) ... [2023-02-15 10:31:27,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:31:27,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:27,903 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:27,913 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:27,945 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 10:31:27,946 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 10:31:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:31:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:31:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:31:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:31:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:31:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:31:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:31:27,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:31:27,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:31:28,040 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:31:28,042 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:31:28,065 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 10:31:28,251 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:31:28,256 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:31:28,256 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 10:31:28,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:28 BoogieIcfgContainer [2023-02-15 10:31:28,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:31:28,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:31:28,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:31:28,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:31:28,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:31:27" (1/3) ... [2023-02-15 10:31:28,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abeddac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:28, skipping insertion in model container [2023-02-15 10:31:28,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:31:27" (2/3) ... [2023-02-15 10:31:28,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abeddac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:31:28, skipping insertion in model container [2023-02-15 10:31:28,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:31:28" (3/3) ... [2023-02-15 10:31:28,264 INFO L112 eAbstractionObserver]: Analyzing ICFG list-1.i [2023-02-15 10:31:28,285 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:31:28,286 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:31:28,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:31:28,349 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;@459801a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:31:28,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:31:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 10:31:28,379 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:28,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:28,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 896526153, now seen corresponding path program 1 times [2023-02-15 10:31:28,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:28,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789012415] [2023-02-15 10:31:28,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:28,519 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:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:28,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789012415] [2023-02-15 10:31:28,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789012415] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:28,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:28,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:31:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598937743] [2023-02-15 10:31:28,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:28,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:31:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:28,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:31:28,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:31:28,551 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:28,572 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2023-02-15 10:31:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:31:28,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2023-02-15 10:31:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:28,578 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:31:28,579 INFO L226 Difference]: Without dead ends: 21 [2023-02-15 10:31:28,581 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:28,584 INFO L413 NwaCegarLoop]: 36 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, 36 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:28,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 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:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-15 10:31:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-15 10:31:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-15 10:31:28,606 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2023-02-15 10:31:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:28,606 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-15 10:31:28,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-15 10:31:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:31:28,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:28,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:28,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:31:28,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:28,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash 283143297, now seen corresponding path program 1 times [2023-02-15 10:31:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:28,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010328738] [2023-02-15 10:31:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:28,851 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:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:28,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010328738] [2023-02-15 10:31:28,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010328738] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:28,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:28,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630219907] [2023-02-15 10:31:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:28,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:28,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:28,856 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:28,983 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2023-02-15 10:31:28,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:31:28,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 10:31:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:28,986 INFO L225 Difference]: With dead ends: 46 [2023-02-15 10:31:28,986 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 10:31:28,986 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:28,987 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:28,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 10:31:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2023-02-15 10:31:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-15 10:31:28,995 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2023-02-15 10:31:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:28,995 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-15 10:31:28,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-15 10:31:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:31:28,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:28,997 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:28,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:31:28,997 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445212, now seen corresponding path program 1 times [2023-02-15 10:31:28,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:28,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515482829] [2023-02-15 10:31:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:29,116 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:29,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:29,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515482829] [2023-02-15 10:31:29,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515482829] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:29,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:29,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:29,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512190833] [2023-02-15 10:31:29,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:29,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:29,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:29,120 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:29,214 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-02-15 10:31:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:31:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-15 10:31:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:29,215 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:31:29,215 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:31:29,216 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:29,217 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:29,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:31:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2023-02-15 10:31:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-02-15 10:31:29,222 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2023-02-15 10:31:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:29,222 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-02-15 10:31:29,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-02-15 10:31:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:31:29,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:29,224 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:29,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:31:29,224 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:29,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1703819108, now seen corresponding path program 1 times [2023-02-15 10:31:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:29,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297872992] [2023-02-15 10:31:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:29,372 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:29,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:29,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297872992] [2023-02-15 10:31:29,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297872992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:31:29,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:31:29,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:31:29,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988646795] [2023-02-15 10:31:29,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:31:29,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:31:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:29,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:31:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:31:29,378 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:29,449 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2023-02-15 10:31:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:31:29,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-15 10:31:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:29,451 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:31:29,451 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 10:31:29,452 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:29,460 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:29,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:31:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 10:31:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2023-02-15 10:31:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-02-15 10:31:29,469 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2023-02-15 10:31:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:29,469 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-02-15 10:31:29,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-02-15 10:31:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:31:29,471 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:29,471 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:29,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:31:29,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:29,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1538293272, now seen corresponding path program 1 times [2023-02-15 10:31:29,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:29,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047362426] [2023-02-15 10:31:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:29,774 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:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:29,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047362426] [2023-02-15 10:31:29,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047362426] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:29,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984048203] [2023-02-15 10:31:29,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:29,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:29,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:29,781 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:29,782 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:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:29,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 10:31:29,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:29,912 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:29,988 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:29,999 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:30,000 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:30,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:30,044 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:30,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:31:30,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 15 treesize of output 7 [2023-02-15 10:31:30,119 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:30,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:30,139 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_84 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2023-02-15 10:31:30,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:30,211 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:30,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:30,225 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:30,231 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:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 10:31:30,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984048203] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:30,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:30,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-02-15 10:31:30,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937537460] [2023-02-15 10:31:30,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:30,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:31:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:31:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=190, Unknown=3, NotChecked=28, Total=272 [2023-02-15 10:31:30,367 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:30,655 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-02-15 10:31:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:31:30,655 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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 20 [2023-02-15 10:31:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:30,656 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:31:30,656 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 10:31:30,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=315, Unknown=3, NotChecked=38, Total=462 [2023-02-15 10:31:30,657 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 130 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:30,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 67 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 114 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2023-02-15 10:31:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 10:31:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-02-15 10:31:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-02-15 10:31:30,662 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2023-02-15 10:31:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:30,663 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-02-15 10:31:30,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-02-15 10:31:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:31:30,663 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:30,663 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:30,672 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:30,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:30,864 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash -674891608, now seen corresponding path program 1 times [2023-02-15 10:31:30,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:30,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960405943] [2023-02-15 10:31:30,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:31,110 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:31,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:31,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960405943] [2023-02-15 10:31:31,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960405943] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:31,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723844796] [2023-02-15 10:31:31,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:31,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:31,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:31,113 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:31,115 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:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:31,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 10:31:31,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:31,190 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:31,234 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:31,235 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:31,243 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:31,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:31,275 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:31,315 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:31,333 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:31,336 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:31,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:31,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:31,425 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:31,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:31,441 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:31,446 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:31,528 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:31,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723844796] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:31,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:31,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-02-15 10:31:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901818985] [2023-02-15 10:31:31,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:31,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:31:31,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:31,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:31:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=214, Unknown=5, NotChecked=0, Total=272 [2023-02-15 10:31:31,533 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:31,824 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2023-02-15 10:31:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:31:31,825 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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 20 [2023-02-15 10:31:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:31,825 INFO L225 Difference]: With dead ends: 46 [2023-02-15 10:31:31,825 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:31:31,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=314, Unknown=5, NotChecked=0, Total=420 [2023-02-15 10:31:31,826 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 47 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:31,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 100 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:31:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:31:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-02-15 10:31:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-02-15 10:31:31,831 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2023-02-15 10:31:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:31,832 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-02-15 10:31:31,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-02-15 10:31:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:31:31,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:31,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:31,843 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:32,042 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,SelfDestructingSolverStorable5 [2023-02-15 10:31:32,043 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash -782408125, now seen corresponding path program 1 times [2023-02-15 10:31:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:32,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549500105] [2023-02-15 10:31:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:32,367 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:32,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:32,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549500105] [2023-02-15 10:31:32,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549500105] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:32,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411773494] [2023-02-15 10:31:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:32,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:32,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:32,373 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:32,375 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:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:32,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 10:31:32,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:32,451 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:32,495 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:32,495 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:32,512 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:32,517 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:32,550 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:32,551 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 52 treesize of output 49 [2023-02-15 10:31:32,555 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 34 treesize of output 36 [2023-02-15 10:31:32,563 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 23 treesize of output 15 [2023-02-15 10:31:32,599 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 31 treesize of output 19 [2023-02-15 10:31:32,603 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 19 treesize of output 11 [2023-02-15 10:31:32,611 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:32,613 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:32,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:32,637 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:32,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:32,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 10:31:32,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:32,707 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:32,719 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:32,725 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:32,728 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:32,825 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:32,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411773494] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:32,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:32,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-02-15 10:31:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882681103] [2023-02-15 10:31:32,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:32,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 10:31:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 10:31:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=170, Unknown=3, NotChecked=0, Total=210 [2023-02-15 10:31:32,828 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:33,039 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2023-02-15 10:31:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:31:33,040 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 10:31:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:33,040 INFO L225 Difference]: With dead ends: 68 [2023-02-15 10:31:33,040 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 10:31:33,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=299, Unknown=3, NotChecked=0, Total=380 [2023-02-15 10:31:33,041 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 72 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:33,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 125 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:31:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 10:31:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2023-02-15 10:31:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2023-02-15 10:31:33,048 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2023-02-15 10:31:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:33,049 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2023-02-15 10:31:33,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 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:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2023-02-15 10:31:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:31:33,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:33,049 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:33,061 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:33,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:33,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash -226254882, now seen corresponding path program 2 times [2023-02-15 10:31:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:33,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706689274] [2023-02-15 10:31:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:33,538 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:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706689274] [2023-02-15 10:31:33,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706689274] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:33,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463384402] [2023-02-15 10:31:33,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:31:33,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:33,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:33,540 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:33,550 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:33,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:31:33,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:31:33,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 10:31:33,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:33,634 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:33,670 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:33,670 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:33,689 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:33,693 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:33,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:33,724 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 52 treesize of output 49 [2023-02-15 10:31:33,727 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 23 treesize of output 15 [2023-02-15 10:31:33,730 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 26 treesize of output 28 [2023-02-15 10:31:33,767 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 31 treesize of output 19 [2023-02-15 10:31:33,770 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 19 treesize of output 11 [2023-02-15 10:31:33,776 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:33,778 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:33,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:33,815 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:33,821 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_240 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_242 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-02-15 10:31:33,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:33,837 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:33,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:33,844 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:33,847 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:33,860 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:33,861 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:33,937 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:33,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463384402] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:33,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:33,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-02-15 10:31:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132936099] [2023-02-15 10:31:33,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:33,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:31:33,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:31:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2023-02-15 10:31:33,939 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:34,189 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2023-02-15 10:31:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:31:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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 24 [2023-02-15 10:31:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:34,190 INFO L225 Difference]: With dead ends: 70 [2023-02-15 10:31:34,190 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 10:31:34,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=444, Unknown=1, NotChecked=44, Total=600 [2023-02-15 10:31:34,191 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:34,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 115 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 175 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2023-02-15 10:31:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 10:31:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2023-02-15 10:31:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-02-15 10:31:34,200 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 24 [2023-02-15 10:31:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:34,201 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-02-15 10:31:34,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-02-15 10:31:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:31:34,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:34,205 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:34,214 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:34,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:34,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:34,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:34,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1990497246, now seen corresponding path program 1 times [2023-02-15 10:31:34,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:34,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33356709] [2023-02-15 10:31:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:34,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:31:34,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33356709] [2023-02-15 10:31:34,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33356709] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537236240] [2023-02-15 10:31:34,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:34,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:34,573 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:34,576 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:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:34,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 10:31:34,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:34,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 10:31:34,675 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:34,675 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:34,694 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:34,698 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:34,731 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:34,731 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:34,734 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:34,737 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:34,758 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:34,760 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:34,772 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:34,782 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:34,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:34,821 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:34,826 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_293 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-02-15 10:31:34,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:34,845 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:34,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:34,851 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:34,854 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:34,868 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:34,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 10:31:34,937 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:34,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537236240] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:34,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:34,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2023-02-15 10:31:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52701302] [2023-02-15 10:31:34,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:34,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 10:31:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:34,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 10:31:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2023-02-15 10:31:34,939 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 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:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:35,300 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-02-15 10:31:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:31:35,300 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 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) Word has length 24 [2023-02-15 10:31:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:35,301 INFO L225 Difference]: With dead ends: 85 [2023-02-15 10:31:35,301 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 10:31:35,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=620, Unknown=1, NotChecked=52, Total=812 [2023-02-15 10:31:35,302 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 73 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 16 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:35,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 250 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 264 Invalid, 9 Unknown, 51 Unchecked, 0.2s Time] [2023-02-15 10:31:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 10:31:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2023-02-15 10:31:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-02-15 10:31:35,308 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 24 [2023-02-15 10:31:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:35,308 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-02-15 10:31:35,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 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:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-02-15 10:31:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:31:35,309 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:35,309 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:35,317 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:35,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:35,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash 17470058, now seen corresponding path program 3 times [2023-02-15 10:31:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966990119] [2023-02-15 10:31:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:36,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:36,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966990119] [2023-02-15 10:31:36,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966990119] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:36,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801409330] [2023-02-15 10:31:36,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:31:36,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:36,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:36,061 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:36,068 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:36,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:31:36,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:31:36,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 10:31:36,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:36,161 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:36,194 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:36,194 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:36,230 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:36,237 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:36,275 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:31:36,276 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:36,279 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:36,294 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:36,294 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:36,301 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:36,364 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:36,364 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:36,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:36,370 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:36,375 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:36,442 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:31:36,442 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:36,456 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 10:31:36,457 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:36,482 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:31:36,483 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:36,499 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:36,517 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:36,813 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:36,830 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-02-15 10:31:36,830 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:37,030 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:37,030 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:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:37,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:37,446 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2023-02-15 10:31:37,447 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 1868 treesize of output 1806 [2023-02-15 10:31:37,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:37,460 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 940 treesize of output 828 [2023-02-15 10:31:39,691 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:31:39,699 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:31:39,839 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:31:39,950 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:31:40,075 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse63 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse62 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (let ((.cse7 (not .cse62)) (.cse8 (not .cse63)) (.cse36 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse67 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse67 0) (= .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_9 .cse1) 0))))) (.cse39 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse66 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse66 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) (.cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse35 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse65 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse65 0) (= .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (.cse41 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |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_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse64 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) (.cse33 (and .cse62 .cse63))) (and (or (and (or .cse0 (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse2 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse2) (= .cse2 0)))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse4 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_9 .cse1) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse5 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse6 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse6) (= .cse6 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|))))))) .cse7 .cse8) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse9 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_384 (Array Int Int))) (not (= (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse1))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse10 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse10) (= .cse10 0)))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse11 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse12 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse1)) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse13) (= .cse13 0) (= .cse13 .cse1)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse14 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse15 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse15) (= .cse15 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse16 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_384 (Array Int Int))) (not (= (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse1))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse17 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse17 0) (not (= .cse17 .cse1))))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse18 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse19) (= .cse19 0)))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse22 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse1)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse23) (= .cse23 0) (= .cse23 .cse1)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse24 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse25) (= .cse25 .cse1)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse27 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse27 0) (= .cse27 .cse1)))))) (not (= (select v_arrayElimArr_9 .cse1) 0))))) .cse0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse28 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse29 0) (not (= .cse29 .cse1))))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse31 0) (= .cse31 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|)))))) .cse33) (or .cse7 .cse8 (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |v_ULTIMATE.start_main_~p~0#1.base_62|)) (forall ((v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse34) (= .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse35 (or (and .cse36 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_384 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse37) (= .cse37 0) (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |v_ULTIMATE.start_main_~p~0#1.base_62|)) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse38 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse38) (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) .cse39) .cse0) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse40 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse40) (= .cse40 0) (= .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse41)) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse42 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse42) (= .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse43 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse44 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse44 0) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse44 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse45 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse45) (= .cse45 0) (= .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |v_ULTIMATE.start_main_~p~0#1.base_62|)) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse46 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse46 .cse1))))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (and (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse47 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse47) (= .cse47 0) (= .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse47 .cse1)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse48 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse48 .cse1)))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse49 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |v_ULTIMATE.start_main_~p~0#1.base_62|)) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse50 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse50) (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse50 .cse1)))))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) .cse36 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse51 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse51) (= .cse51 0) (= .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse52 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse52 0) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse52 .cse1)))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int) (v_ArrVal_384 (Array Int Int))) (let ((.cse53 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse53 0) (= .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse53 .cse1))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |v_ULTIMATE.start_main_~p~0#1.base_62|)) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse54 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse54 .cse1))))))))) .cse39 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse55 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse55) (= .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse56 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse56 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= (select v_arrayElimArr_9 .cse1) 0))))) .cse0) .cse35 (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse57 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse57 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse58 |v_ULTIMATE.start_main_~p~0#1.base_62|) (= .cse58 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse59 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse59) (= .cse59 0) (= .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse59 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_385 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_379) |v_ULTIMATE.start_main_~p~0#1.base_62| v_ArrVal_385) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) |v_ULTIMATE.start_main_~p~0#1.base_62|)) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse60 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse60) (= .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse60 .cse1)))))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_62| Int)) (or (forall ((v_ArrVal_384 (Array Int Int))) (let ((.cse61 (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_62| v_ArrVal_384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= .cse61 0) (= .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse61 .cse1))))) (= |v_ULTIMATE.start_main_~p~0#1.base_62| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse41) .cse33))))) is different from false [2023-02-15 10:31:41,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,095 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 78 treesize of output 58 [2023-02-15 10:31:41,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,103 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:31:41,107 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,117 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 90 treesize of output 77 [2023-02-15 10:31:41,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,129 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 44 treesize of output 36 [2023-02-15 10:31:41,148 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,154 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:31:41,158 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:41,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,205 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:31:41,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,213 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:31:41,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:41,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2023-02-15 10:31:41,222 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,230 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:31:41,234 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:31:41,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:41,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 10:31:41,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,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 51 treesize of output 41 [2023-02-15 10:31:41,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,275 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:31:41,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:41,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:41,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-15 10:31:41,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 8 treesize of output 4 [2023-02-15 10:31:41,291 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 7 [2023-02-15 10:31:41,295 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 10 treesize of output 4 [2023-02-15 10:31:41,298 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:41,300 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,302 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,304 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,305 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,307 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,308 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,310 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,311 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,312 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,321 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,321 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:31:41,330 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,330 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 53 treesize of output 1 [2023-02-15 10:31:41,339 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,339 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:31:41,346 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,346 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 79 treesize of output 1 [2023-02-15 10:31:41,354 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,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 51 treesize of output 1 [2023-02-15 10:31:41,361 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,362 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 103 treesize of output 1 [2023-02-15 10:31:41,370 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,370 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 54 treesize of output 1 [2023-02-15 10:31:41,378 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,379 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 78 treesize of output 1 [2023-02-15 10:31:41,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,388 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:31:41,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,395 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:31:41,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:41,399 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,401 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:31:41,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:41,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,407 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:31:41,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,411 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:31:41,415 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:41,417 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,419 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,420 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,422 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,423 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,436 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,437 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 28 treesize of output 1 [2023-02-15 10:31:41,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,445 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 27 treesize of output 28 [2023-02-15 10:31:41,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,454 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:31:41,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:41,458 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,461 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 20 treesize of output 14 [2023-02-15 10:31:41,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:41,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:41,472 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:31:41,477 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:31:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:41,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-02-15 10:31:41,513 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,518 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,526 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,526 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 53 treesize of output 1 [2023-02-15 10:31:41,529 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,531 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,535 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,537 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,538 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,540 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,541 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,543 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,544 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,554 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,554 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 78 treesize of output 1 [2023-02-15 10:31:41,560 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,560 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 76 treesize of output 1 [2023-02-15 10:31:41,567 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:31:41,568 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 54 treesize of output 1 [2023-02-15 10:31:41,572 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,576 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,578 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,579 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,581 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,583 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,585 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,586 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,587 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 10:31:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 10:31:41,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801409330] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:31:41,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:31:41,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2023-02-15 10:31:41,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96778749] [2023-02-15 10:31:41,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:31:41,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 10:31:41,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:31:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 10:31:41,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=888, Unknown=3, NotChecked=60, Total=1056 [2023-02-15 10:31:41,796 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 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:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:31:43,339 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2023-02-15 10:31:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 10:31:43,340 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 10:31:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:31:43,340 INFO L225 Difference]: With dead ends: 86 [2023-02-15 10:31:43,340 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 10:31:43,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=290, Invalid=1967, Unknown=3, NotChecked=92, Total=2352 [2023-02-15 10:31:43,341 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 135 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:31:43,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 262 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 427 Invalid, 2 Unknown, 56 Unchecked, 0.3s Time] [2023-02-15 10:31:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 10:31:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2023-02-15 10:31:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:31:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-02-15 10:31:43,348 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 26 [2023-02-15 10:31:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:31:43,348 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-02-15 10:31:43,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 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:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-02-15 10:31:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:31:43,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:31:43,353 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:31:43,359 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:31:43,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:43,559 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:31:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:31:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2093251050, now seen corresponding path program 1 times [2023-02-15 10:31:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:31:43,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398462742] [2023-02-15 10:31:43,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:31:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:44,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:31:44,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398462742] [2023-02-15 10:31:44,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398462742] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:31:44,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308784836] [2023-02-15 10:31:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:31:44,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:31:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:31:44,161 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:31:44,164 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:31:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:31:44,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 69 conjunts are in the unsatisfiable core [2023-02-15 10:31:44,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:31:44,258 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,287 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:31:44,288 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:31:44,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:31:44,349 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:44,392 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:31:44,392 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:31:44,404 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 10:31:44,405 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:31:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:31:44,413 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 14 treesize of output 16 [2023-02-15 10:31:44,418 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,476 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 10:31:44,477 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 141 treesize of output 103 [2023-02-15 10:31:44,481 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:44,484 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 115 treesize of output 93 [2023-02-15 10:31:44,589 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 10:31:44,590 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 174 treesize of output 145 [2023-02-15 10:31:44,605 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 10:31:44,606 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 146 treesize of output 134 [2023-02-15 10:31:44,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2023-02-15 10:31:44,691 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 10:31:44,692 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 123 treesize of output 60 [2023-02-15 10:31:44,695 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 49 treesize of output 26 [2023-02-15 10:31:44,732 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:31:44,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2023-02-15 10:31:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:31:44,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:31:44,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:44,906 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 75 treesize of output 79 [2023-02-15 10:31:44,924 INFO L321 Elim1Store]: treesize reduction 4, result has 91.7 percent of original size [2023-02-15 10:31:44,924 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 1182 treesize of output 1140 [2023-02-15 10:31:44,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:44,933 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 1022 treesize of output 925 [2023-02-15 10:31:45,496 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:31:45,594 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:31:45,633 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 30 treesize of output 22 [2023-02-15 10:31:45,701 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 60 treesize of output 44 [2023-02-15 10:31:45,859 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 81 treesize of output 61 [2023-02-15 10:31:57,655 WARN L233 SmtUtils]: Spent 11.17s on a formula simplification. DAG size of input: 161 DAG size of output: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:31:58,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,016 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 59 treesize of output 49 [2023-02-15 10:31:58,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:58,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,025 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:31:58,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,046 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 40 treesize of output 32 [2023-02-15 10:31:58,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,064 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 61 treesize of output 51 [2023-02-15 10:31:58,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,075 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 333 treesize of output 212 [2023-02-15 10:31:58,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,085 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 29 treesize of output 30 [2023-02-15 10:31:58,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,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 85 treesize of output 81 [2023-02-15 10:31:58,109 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 139 treesize of output 123 [2023-02-15 10:31:58,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:31:58,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,127 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:31:58,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,148 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 151 treesize of output 115 [2023-02-15 10:31:58,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,298 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 30 treesize of output 31 [2023-02-15 10:31:58,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,305 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 82 treesize of output 72 [2023-02-15 10:31:58,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,316 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 196 treesize of output 147 [2023-02-15 10:31:58,321 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 74 treesize of output 66 [2023-02-15 10:31:58,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,331 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 75 treesize of output 75 [2023-02-15 10:31:58,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,348 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 182 treesize of output 175 [2023-02-15 10:31:58,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,360 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 232 treesize of output 164 [2023-02-15 10:31:58,366 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 104 treesize of output 88 [2023-02-15 10:31:58,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,547 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 30 treesize of output 31 [2023-02-15 10:31:58,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,561 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 181 treesize of output 138 [2023-02-15 10:31:58,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,569 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 34 treesize of output 35 [2023-02-15 10:31:58,576 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 74 treesize of output 66 [2023-02-15 10:31:58,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,591 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 75 treesize of output 75 [2023-02-15 10:31:58,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,610 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 205 treesize of output 198 [2023-02-15 10:31:58,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,623 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 255 treesize of output 179 [2023-02-15 10:31:58,630 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 118 treesize of output 102 [2023-02-15 10:31:58,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,800 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 233 treesize of output 204 [2023-02-15 10:31:58,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,818 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 855 treesize of output 590 [2023-02-15 10:31:58,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,831 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 569 treesize of output 560 [2023-02-15 10:31:58,837 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 549 treesize of output 533 [2023-02-15 10:31:58,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,856 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 656 treesize of output 649 [2023-02-15 10:31:58,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,872 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 633 treesize of output 598 [2023-02-15 10:31:58,879 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 589 treesize of output 581 [2023-02-15 10:31:58,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,894 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 581 treesize of output 582 [2023-02-15 10:31:58,902 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 573 treesize of output 565 [2023-02-15 10:31:58,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,918 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 565 treesize of output 554 [2023-02-15 10:31:58,925 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 545 treesize of output 513 [2023-02-15 10:31:58,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,945 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 513 treesize of output 510 [2023-02-15 10:31:58,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:31:58,984 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 501 treesize of output 462 [2023-02-15 10:31:58,992 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 453 treesize of output 445 [2023-02-15 10:32:07,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,658 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 61 treesize of output 51 [2023-02-15 10:32:07,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,668 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 309 treesize of output 212 [2023-02-15 10:32:07,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,677 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 29 treesize of output 30 [2023-02-15 10:32:07,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:07,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,690 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:07,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,707 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 175 treesize of output 139 [2023-02-15 10:32:07,712 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 115 treesize of output 99 [2023-02-15 10:32:07,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,722 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 61 treesize of output 57 [2023-02-15 10:32:07,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,834 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 29 treesize of output 30 [2023-02-15 10:32:07,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,841 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 35 treesize of output 36 [2023-02-15 10:32:07,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,852 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 168 treesize of output 125 [2023-02-15 10:32:07,864 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,864 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 45 treesize of output 45 [2023-02-15 10:32:07,869 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 66 treesize of output 58 [2023-02-15 10:32:07,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:07,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,882 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:07,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,890 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 86 treesize of output 66 [2023-02-15 10:32:07,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,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 29 treesize of output 30 [2023-02-15 10:32:07,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:32:07,971 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:07,972 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:32:07,974 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 18 treesize of output 10 [2023-02-15 10:32:07,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:07,982 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 25 treesize of output 26 [2023-02-15 10:32:07,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:32:07,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:07,990 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:32:07,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 10:32:08,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,004 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 59 treesize of output 49 [2023-02-15 10:32:08,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,010 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 35 treesize of output 36 [2023-02-15 10:32:08,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,028 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 482 treesize of output 331 [2023-02-15 10:32:08,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,042 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 151 treesize of output 139 [2023-02-15 10:32:08,051 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 267 treesize of output 235 [2023-02-15 10:32:08,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:08,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,069 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:32:08,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,080 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 256 treesize of output 208 [2023-02-15 10:32:08,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,629 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 59 treesize of output 49 [2023-02-15 10:32:08,632 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:08,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,643 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 61 treesize of output 54 [2023-02-15 10:32:08,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,663 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 33 treesize of output 29 [2023-02-15 10:32:08,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,676 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 78 treesize of output 58 [2023-02-15 10:32:08,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:08,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,686 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 118 treesize of output 81 [2023-02-15 10:32:08,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,696 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 44 treesize of output 36 [2023-02-15 10:32:08,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 10:32:08,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,783 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 224 treesize of output 157 [2023-02-15 10:32:08,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,789 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 59 treesize of output 49 [2023-02-15 10:32:08,792 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:08,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,800 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 61 treesize of output 54 [2023-02-15 10:32:08,804 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 70 treesize of output 62 [2023-02-15 10:32:08,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,812 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 41 treesize of output 41 [2023-02-15 10:32:08,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,819 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 90 treesize of output 70 [2023-02-15 10:32:08,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,886 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 61 treesize of output 51 [2023-02-15 10:32:08,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,892 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 35 treesize of output 36 [2023-02-15 10:32:08,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,904 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 310 treesize of output 195 [2023-02-15 10:32:08,909 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 147 treesize of output 131 [2023-02-15 10:32:08,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,920 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 77 treesize of output 73 [2023-02-15 10:32:08,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:08,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,932 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:32:08,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:08,940 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 144 treesize of output 112 [2023-02-15 10:32:09,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,036 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 29 treesize of output 30 [2023-02-15 10:32:09,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,045 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 255 treesize of output 200 [2023-02-15 10:32:09,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,052 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 29 treesize of output 30 [2023-02-15 10:32:09,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,061 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 150 treesize of output 146 [2023-02-15 10:32:09,075 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 134 treesize of output 118 [2023-02-15 10:32:09,081 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:09,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,094 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:32:09,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,116 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 139 treesize of output 115 [2023-02-15 10:32:09,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,417 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 61 treesize of output 51 [2023-02-15 10:32:09,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,428 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 296 treesize of output 205 [2023-02-15 10:32:09,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,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 29 treesize of output 30 [2023-02-15 10:32:09,445 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 147 treesize of output 131 [2023-02-15 10:32:09,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,457 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 77 treesize of output 73 [2023-02-15 10:32:09,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:09,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,474 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:32:09,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,483 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 144 treesize of output 112 [2023-02-15 10:32:09,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,608 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 29 treesize of output 30 [2023-02-15 10:32:09,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,615 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 71 treesize of output 61 [2023-02-15 10:32:09,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,626 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 217 treesize of output 144 [2023-02-15 10:32:09,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,640 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 45 treesize of output 45 [2023-02-15 10:32:09,644 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:09,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,653 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:09,671 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 66 treesize of output 58 [2023-02-15 10:32:09,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,679 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 97 treesize of output 73 [2023-02-15 10:32:09,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,739 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 78 treesize of output 58 [2023-02-15 10:32:09,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:32:09,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,748 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 118 treesize of output 81 [2023-02-15 10:32:09,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:09,760 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 44 treesize of output 36 [2023-02-15 10:32:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:32:16,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308784836] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:32:16,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:32:16,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-02-15 10:32:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063726587] [2023-02-15 10:32:16,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:32:16,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 10:32:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:32:16,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 10:32:16,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=605, Unknown=3, NotChecked=0, Total=702 [2023-02-15 10:32:16,417 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 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:32:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:32:18,440 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2023-02-15 10:32:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 10:32:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 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) Word has length 26 [2023-02-15 10:32:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:32:18,441 INFO L225 Difference]: With dead ends: 91 [2023-02-15 10:32:18,441 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 10:32:18,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=299, Invalid=1768, Unknown=3, NotChecked=0, Total=2070 [2023-02-15 10:32:18,443 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 78 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 36 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:32:18,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 239 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 458 Invalid, 4 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 10:32:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 10:32:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2023-02-15 10:32:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 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:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2023-02-15 10:32:18,451 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 26 [2023-02-15 10:32:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:32:18,451 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2023-02-15 10:32:18,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 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:32:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2023-02-15 10:32:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 10:32:18,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:32:18,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:32:18,468 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:32:18,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:32:18,658 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:32:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:32:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash -342467003, now seen corresponding path program 4 times [2023-02-15 10:32:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:32:18,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109417872] [2023-02-15 10:32:18,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:32:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:32:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:32:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:32:19,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:32:19,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109417872] [2023-02-15 10:32:19,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109417872] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:32:19,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592569116] [2023-02-15 10:32:19,361 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:32:19,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:32:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:32:19,365 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:32:19,367 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:32:19,453 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:32:19,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:32:19,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 10:32:19,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:32:19,460 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:19,526 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:32:19,527 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:32:19,578 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:32:19,585 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:32:19,641 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:32:19,642 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 37 treesize of output 35 [2023-02-15 10:32:19,656 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 10:32:19,656 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 22 treesize of output 24 [2023-02-15 10:32:19,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:32:19,673 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 25 treesize of output 25 [2023-02-15 10:32:19,731 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-02-15 10:32:19,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2023-02-15 10:32:19,735 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 133 treesize of output 99 [2023-02-15 10:32:19,818 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 10:32:19,819 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 195 treesize of output 158 [2023-02-15 10:32:19,839 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2023-02-15 10:32:19,839 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 170 treesize of output 156 [2023-02-15 10:32:19,846 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 65 treesize of output 43 [2023-02-15 10:32:20,007 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 10:32:20,007 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 167 treesize of output 68 [2023-02-15 10:32:20,011 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 59 treesize of output 22 [2023-02-15 10:32:20,044 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:32:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:32:20,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:32:20,113 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:32:20,236 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (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|) .cse5 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (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|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_564 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_564))) (select (select .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((v_ArrVal_564 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_565))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ 4 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) is different from false [2023-02-15 10:32:20,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:20,251 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 109 treesize of output 103 [2023-02-15 10:32:20,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:20,258 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 122 treesize of output 116 [2023-02-15 10:32:20,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:20,384 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:32:20,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:20,389 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:32:20,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:20,398 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 452 treesize of output 445 [2023-02-15 10:32:20,959 INFO L321 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2023-02-15 10:32:20,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 12440 treesize of output 11447 [2023-02-15 10:32:21,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:21,040 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 11094 treesize of output 7306 [2023-02-15 10:32:21,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:21,106 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 7224 treesize of output 6128 [2023-02-15 10:32:21,132 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 267 treesize of output 191 [2023-02-15 10:32:21,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:32:21,166 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 255 treesize of output 183