./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 6c24879c 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-?-6c24879 [2022-07-12 03:14:55,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:14:55,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:14:55,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:14:55,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:14:55,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:14:55,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:14:55,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:14:55,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:14:55,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:14:55,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:14:55,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:14:55,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:14:55,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:14:55,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:14:55,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:14:55,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:14:55,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:14:55,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:14:55,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:14:55,834 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:14:55,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:14:55,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:14:55,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:14:55,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:14:55,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:14:55,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:14:55,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:14:55,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:14:55,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:14:55,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:14:55,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:14:55,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:14:55,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:14:55,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:14:55,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:14:55,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:14:55,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:14:55,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:14:55,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:14:55,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:14:55,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:14:55,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:14:55,873 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:14:55,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:14:55,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:14:55,874 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:14:55,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:14:55,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:14:55,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:14:55,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:14:55,876 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:14:55,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:14:55,876 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:14:55,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:14:55,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:14:55,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:14:55,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:14:55,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:14:55,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:14:55,877 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:14:55,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:14:55,878 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:14:55,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:14:55,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:14:55,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:14:55,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:14:55,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:14:55,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:14:55,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:14:55,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:14:55,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:14:55,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:14:55,880 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:14:55,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:14:55,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:14:55,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-07-12 03:14:56,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:14:56,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:14:56,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:14:56,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:14:56,129 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:14:56,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2022-07-12 03:14:56,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc52cd9/f16af4de71a74e319487c0d90cb18842/FLAG0c5e81fc0 [2022-07-12 03:14:56,572 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:14:56,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2022-07-12 03:14:56,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc52cd9/f16af4de71a74e319487c0d90cb18842/FLAG0c5e81fc0 [2022-07-12 03:14:56,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fc52cd9/f16af4de71a74e319487c0d90cb18842 [2022-07-12 03:14:56,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:14:56,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:14:56,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:14:56,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:14:56,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:14:56,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:56,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc94bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56, skipping insertion in model container [2022-07-12 03:14:56,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:56,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:14:56,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:14:56,861 WARN L230 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] [2022-07-12 03:14:56,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:14:56,869 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:14:56,906 WARN L230 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] [2022-07-12 03:14:56,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:14:56,923 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:14:56,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56 WrapperNode [2022-07-12 03:14:56,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:14:56,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:14:56,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:14:56,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:14:56,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:56,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:56,970 INFO L137 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-07-12 03:14:56,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:14:56,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:14:56,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:14:56,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:14:56,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:56,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:56,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:56,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:56,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:57,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:57,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:57,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:14:57,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:14:57,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:14:57,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:14:57,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (1/1) ... [2022-07-12 03:14:57,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:14:57,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:57,033 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) [2022-07-12 03:14:57,036 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 [2022-07-12 03:14:57,062 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 03:14:57,063 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 03:14:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:14:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:14:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:14:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:14:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:14:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:14:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:14:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:14:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:14:57,125 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:14:57,126 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:14:57,151 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 03:14:57,299 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:14:57,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:14:57,303 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 03:14:57,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:14:57 BoogieIcfgContainer [2022-07-12 03:14:57,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:14:57,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:14:57,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:14:57,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:14:57,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:14:56" (1/3) ... [2022-07-12 03:14:57,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efd8c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:14:57, skipping insertion in model container [2022-07-12 03:14:57,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:56" (2/3) ... [2022-07-12 03:14:57,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efd8c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:14:57, skipping insertion in model container [2022-07-12 03:14:57,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:14:57" (3/3) ... [2022-07-12 03:14:57,317 INFO L111 eAbstractionObserver]: Analyzing ICFG list-1.i [2022-07-12 03:14:57,326 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:14:57,327 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:14:57,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:14:57,369 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@719da95d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70631f2a [2022-07-12 03:14:57,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:14:57,372 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) [2022-07-12 03:14:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:14:57,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:57,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:57,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash 896526153, now seen corresponding path program 1 times [2022-07-12 03:14:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:57,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008041175] [2022-07-12 03:14:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:57,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:57,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008041175] [2022-07-12 03:14:57,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008041175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:57,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:57,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:14:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91325751] [2022-07-12 03:14:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:57,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:14:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:57,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:14:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:14:57,531 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) [2022-07-12 03:14:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:57,547 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-07-12 03:14:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:14:57,549 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 [2022-07-12 03:14:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:57,552 INFO L225 Difference]: With dead ends: 50 [2022-07-12 03:14:57,553 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 03:14:57,554 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 [2022-07-12 03:14:57,557 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 [2022-07-12 03:14:57,557 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] [2022-07-12 03:14:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 03:14:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 03:14:57,575 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) [2022-07-12 03:14:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-12 03:14:57,577 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2022-07-12 03:14:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:57,577 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-12 03:14:57,577 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) [2022-07-12 03:14:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-12 03:14:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:14:57,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:57,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:57,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:14:57,579 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash 283143297, now seen corresponding path program 1 times [2022-07-12 03:14:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:57,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334470413] [2022-07-12 03:14:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:57,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:57,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334470413] [2022-07-12 03:14:57,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334470413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:57,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:57,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:14:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555913042] [2022-07-12 03:14:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:57,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:14:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:57,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:14:57,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:14:57,680 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) [2022-07-12 03:14:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:57,767 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-07-12 03:14:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:14:57,768 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 [2022-07-12 03:14:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:57,770 INFO L225 Difference]: With dead ends: 46 [2022-07-12 03:14:57,770 INFO L226 Difference]: Without dead ends: 42 [2022-07-12 03:14:57,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:14:57,774 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2022-07-12 03:14:57,774 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] [2022-07-12 03:14:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-12 03:14:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-07-12 03:14:57,779 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) [2022-07-12 03:14:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-12 03:14:57,780 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2022-07-12 03:14:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:57,781 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-12 03:14:57,781 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) [2022-07-12 03:14:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-12 03:14:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:14:57,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:57,782 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:57,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:14:57,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445212, now seen corresponding path program 1 times [2022-07-12 03:14:57,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:57,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605494057] [2022-07-12 03:14:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:57,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:57,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:57,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605494057] [2022-07-12 03:14:57,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605494057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:57,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:57,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:14:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432139836] [2022-07-12 03:14:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:57,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:14:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:14:57,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:14:57,845 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) [2022-07-12 03:14:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:57,923 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-12 03:14:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:14:57,924 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 [2022-07-12 03:14:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:57,925 INFO L225 Difference]: With dead ends: 48 [2022-07-12 03:14:57,926 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 03:14:57,927 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 [2022-07-12 03:14:57,928 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:57,929 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.0s Time] [2022-07-12 03:14:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 03:14:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-07-12 03:14:57,932 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) [2022-07-12 03:14:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-12 03:14:57,933 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-07-12 03:14:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:57,934 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-12 03:14:57,934 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) [2022-07-12 03:14:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-12 03:14:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:14:57,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:57,935 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:57,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:14:57,936 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1703819108, now seen corresponding path program 1 times [2022-07-12 03:14:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:57,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164794811] [2022-07-12 03:14:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:57,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164794811] [2022-07-12 03:14:57,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164794811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:57,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:57,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:14:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891470459] [2022-07-12 03:14:57,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:57,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:14:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:14:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:14:57,988 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) [2022-07-12 03:14:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:58,034 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-12 03:14:58,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:14:58,034 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 [2022-07-12 03:14:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:58,035 INFO L225 Difference]: With dead ends: 48 [2022-07-12 03:14:58,035 INFO L226 Difference]: Without dead ends: 37 [2022-07-12 03:14:58,037 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 [2022-07-12 03:14:58,044 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 [2022-07-12 03:14:58,046 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] [2022-07-12 03:14:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-12 03:14:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-07-12 03:14:58,055 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) [2022-07-12 03:14:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-12 03:14:58,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-07-12 03:14:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:58,056 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-12 03:14:58,056 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) [2022-07-12 03:14:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-12 03:14:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:14:58,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:58,058 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:58,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:14:58,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:58,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1538293272, now seen corresponding path program 1 times [2022-07-12 03:14:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:58,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549211333] [2022-07-12 03:14:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:58,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:58,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549211333] [2022-07-12 03:14:58,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549211333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:58,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918145278] [2022-07-12 03:14:58,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:58,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:58,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:58,251 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) [2022-07-12 03:14:58,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:14:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:58,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 03:14:58,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:58,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,503 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:14:58,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:58,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:58,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:58,663 WARN L833 $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 [2022-07-12 03:14:58,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_84 (Array Int Int)) (v_ArrVal_82 Int)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_82)) |c_ULTIMATE.start_main_~t~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 [2022-07-12 03:14:58,712 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:14:58,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:58,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:14:58,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918145278] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:58,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:14:58,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-07-12 03:14:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883143293] [2022-07-12 03:14:58,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:58,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 03:14:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 03:14:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-07-12 03:14:58,893 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) [2022-07-12 03:14:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:59,002 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-07-12 03:14:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:14:59,003 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 [2022-07-12 03:14:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:59,004 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:14:59,004 INFO L226 Difference]: Without dead ends: 41 [2022-07-12 03:14:59,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=268, Unknown=2, NotChecked=70, Total=420 [2022-07-12 03:14:59,005 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:59,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 99 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 74 Unchecked, 0.0s Time] [2022-07-12 03:14:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-12 03:14:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-07-12 03:14:59,012 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) [2022-07-12 03:14:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-12 03:14:59,014 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2022-07-12 03:14:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:59,014 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-12 03:14:59,015 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) [2022-07-12 03:14:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-12 03:14:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:14:59,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:59,015 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:59,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 03:14:59,231 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 [2022-07-12 03:14:59,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash -674891608, now seen corresponding path program 1 times [2022-07-12 03:14:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665192649] [2022-07-12 03:14:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665192649] [2022-07-12 03:14:59,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665192649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986202770] [2022-07-12 03:14:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:59,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:59,337 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) [2022-07-12 03:14:59,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:14:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:59,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 03:14:59,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:59,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,450 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:14:59,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:59,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:59,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:59,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_136 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-12 03:14:59,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_135 Int) (v_ArrVal_136 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_135)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-12 03:14:59,612 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:14:59,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:59,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:14:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:14:59,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986202770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:59,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:14:59,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-07-12 03:14:59,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741005566] [2022-07-12 03:14:59,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:59,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 03:14:59,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:59,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 03:14:59,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-07-12 03:14:59,685 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) [2022-07-12 03:14:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:59,818 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-07-12 03:14:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:14:59,819 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 [2022-07-12 03:14:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:59,819 INFO L225 Difference]: With dead ends: 70 [2022-07-12 03:14:59,819 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 03:14:59,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=257, Unknown=2, NotChecked=70, Total=420 [2022-07-12 03:14:59,820 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 58 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:59,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 157 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2022-07-12 03:14:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 03:14:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2022-07-12 03:14:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 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) [2022-07-12 03:14:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-07-12 03:14:59,823 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2022-07-12 03:14:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:59,824 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-07-12 03:14:59,824 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) [2022-07-12 03:14:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-07-12 03:14:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:14:59,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:59,824 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] [2022-07-12 03:14:59,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 [2022-07-12 03:15:00,025 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 [2022-07-12 03:15:00,025 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash -782408125, now seen corresponding path program 1 times [2022-07-12 03:15:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:00,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353526545] [2022-07-12 03:15:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:00,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:00,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353526545] [2022-07-12 03:15:00,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353526545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:00,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698034111] [2022-07-12 03:15:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:00,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:00,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:00,127 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) [2022-07-12 03:15:00,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:15:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:00,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 03:15:00,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:00,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,225 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:00,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,287 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:00,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-12 03:15:00,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:00,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:00,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,369 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_189 (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_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_186 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-12 03:15:00,384 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:00,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:00,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:00,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,401 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:00,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:15:00,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698034111] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:00,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:00,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-12 03:15:00,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569199891] [2022-07-12 03:15:00,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:00,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 03:15:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:00,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 03:15:00,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2022-07-12 03:15:00,464 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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) [2022-07-12 03:15:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:00,649 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-07-12 03:15:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:15:00,650 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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) Word has length 22 [2022-07-12 03:15:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:00,650 INFO L225 Difference]: With dead ends: 63 [2022-07-12 03:15:00,650 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 03:15:00,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=368, Unknown=1, NotChecked=40, Total=506 [2022-07-12 03:15:00,651 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 104 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:00,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 143 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 191 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-07-12 03:15:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 03:15:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-07-12 03:15:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-07-12 03:15:00,654 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2022-07-12 03:15:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:00,654 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-07-12 03:15:00,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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) [2022-07-12 03:15:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-07-12 03:15:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:15:00,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:00,655 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] [2022-07-12 03:15:00,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:00,859 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 [2022-07-12 03:15:00,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash -226254882, now seen corresponding path program 2 times [2022-07-12 03:15:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:00,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080053598] [2022-07-12 03:15:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:00,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080053598] [2022-07-12 03:15:00,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080053598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:00,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416775860] [2022-07-12 03:15:00,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:15:00,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:00,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:00,967 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) [2022-07-12 03:15:00,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:15:01,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:15:01,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:01,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 03:15:01,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:01,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,087 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:01,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,155 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:01,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:01,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:01,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,242 WARN L833 $PredicateComparison]: unable to prove that (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-12 03:15:01,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:01,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:01,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 [2022-07-12 03:15:01,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,280 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:01,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:15:01,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416775860] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:01,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:01,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-07-12 03:15:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986494865] [2022-07-12 03:15:01,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:01,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 03:15:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 03:15:01,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2022-07-12 03:15:01,342 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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) [2022-07-12 03:15:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:01,597 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-07-12 03:15:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:15:01,598 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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 [2022-07-12 03:15:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:01,598 INFO L225 Difference]: With dead ends: 65 [2022-07-12 03:15:01,598 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 03:15:01,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=566, Unknown=1, NotChecked=50, Total=756 [2022-07-12 03:15:01,599 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 114 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:01,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 169 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 226 Invalid, 0 Unknown, 82 Unchecked, 0.1s Time] [2022-07-12 03:15:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 03:15:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2022-07-12 03:15:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 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) [2022-07-12 03:15:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-07-12 03:15:01,602 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2022-07-12 03:15:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:01,602 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-07-12 03:15:01,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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) [2022-07-12 03:15:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-07-12 03:15:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:15:01,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:01,603 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] [2022-07-12 03:15:01,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:01,803 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 [2022-07-12 03:15:01,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1990497246, now seen corresponding path program 1 times [2022-07-12 03:15:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:01,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338011878] [2022-07-12 03:15:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:15:01,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:01,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338011878] [2022-07-12 03:15:01,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338011878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:01,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956820866] [2022-07-12 03:15:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:01,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:01,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:01,881 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) [2022-07-12 03:15:01,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:15:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:01,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 03:15:01,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:01,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,954 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:01,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:01,996 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:01,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:02,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:02,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,083 WARN L833 $PredicateComparison]: unable to prove that (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (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|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-12 03:15:02,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:02,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:02,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 [2022-07-12 03:15:02,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,114 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:02,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:15:02,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956820866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:02,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:02,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-07-12 03:15:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743628491] [2022-07-12 03:15:02,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:02,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 03:15:02,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:02,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 03:15:02,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=261, Unknown=1, NotChecked=32, Total=342 [2022-07-12 03:15:02,180 INFO L87 Difference]: Start difference. First operand 38 states and 44 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) [2022-07-12 03:15:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:02,342 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-07-12 03:15:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:15:02,343 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 [2022-07-12 03:15:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:02,343 INFO L225 Difference]: With dead ends: 58 [2022-07-12 03:15:02,343 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 03:15:02,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=504, Unknown=1, NotChecked=46, Total=650 [2022-07-12 03:15:02,344 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:02,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 145 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2022-07-12 03:15:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 03:15:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-07-12 03:15:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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) [2022-07-12 03:15:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-07-12 03:15:02,346 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 24 [2022-07-12 03:15:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:02,346 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-07-12 03:15:02,346 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) [2022-07-12 03:15:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-07-12 03:15:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:15:02,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:02,347 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:02,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:02,554 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 [2022-07-12 03:15:02,554 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash 366447567, now seen corresponding path program 2 times [2022-07-12 03:15:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:02,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779472250] [2022-07-12 03:15:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:02,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779472250] [2022-07-12 03:15:02,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779472250] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:02,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935522416] [2022-07-12 03:15:02,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:15:02,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:02,668 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) [2022-07-12 03:15:02,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:15:02,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:15:02,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:02,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 03:15:02,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:02,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,764 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:02,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:02,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,838 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:15:02,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 03:15:02,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:02,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:04,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2022-07-12 03:15:04,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) is different from false [2022-07-12 03:15:04,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-07-12 03:15:04,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_373 Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_373)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-07-12 03:15:04,189 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:04,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 95 treesize of output 61 [2022-07-12 03:15:04,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:04,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 547 treesize of output 537 [2022-07-12 03:15:04,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 535 treesize of output 503 [2022-07-12 03:15:04,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-12 03:15:04,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:04,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 281 treesize of output 271 [2022-07-12 03:15:05,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 275 treesize of output 259 [2022-07-12 03:15:05,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:05,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 415 treesize of output 395 [2022-07-12 03:15:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-12 03:15:06,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935522416] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:06,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:06,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-07-12 03:15:06,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968070114] [2022-07-12 03:15:06,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:06,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:15:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:06,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:15:06,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=286, Unknown=4, NotChecked=148, Total=506 [2022-07-12 03:15:06,153 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 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) [2022-07-12 03:15:06,215 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:06,219 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:06,221 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:07,246 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:07,327 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-07-12 03:15:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 03:15:07,328 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 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 [2022-07-12 03:15:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:07,329 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:15:07,329 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 03:15:07,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=100, Invalid=386, Unknown=8, NotChecked=376, Total=870 [2022-07-12 03:15:07,332 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:07,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 185 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 168 Invalid, 0 Unknown, 201 Unchecked, 0.1s Time] [2022-07-12 03:15:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 03:15:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 44. [2022-07-12 03:15:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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) [2022-07-12 03:15:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-12 03:15:07,346 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2022-07-12 03:15:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:07,349 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-12 03:15:07,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 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) [2022-07-12 03:15:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-12 03:15:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:15:07,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:07,350 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, 1, 1] [2022-07-12 03:15:07,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:07,550 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 [2022-07-12 03:15:07,551 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash 666149519, now seen corresponding path program 1 times [2022-07-12 03:15:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:07,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150414011] [2022-07-12 03:15:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:07,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:07,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150414011] [2022-07-12 03:15:07,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150414011] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:07,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397597654] [2022-07-12 03:15:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:07,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:07,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:07,704 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) [2022-07-12 03:15:07,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 03:15:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:07,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 03:15:07,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:07,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:07,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:07,796 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:07,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:07,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:07,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:07,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:07,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:07,873 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:15:07,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 03:15:07,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:07,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:09,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-12 03:15:09,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-12 03:15:09,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2022-07-12 03:15:09,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_457)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-12 03:15:09,111 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:09,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 95 treesize of output 61 [2022-07-12 03:15:09,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:09,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 547 treesize of output 537 [2022-07-12 03:15:09,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 535 treesize of output 503 [2022-07-12 03:15:09,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-12 03:15:09,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:09,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 281 treesize of output 271 [2022-07-12 03:15:09,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 275 treesize of output 259 [2022-07-12 03:15:10,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:10,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 371 treesize of output 357 [2022-07-12 03:15:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 03:15:10,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397597654] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:10,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:10,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-07-12 03:15:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700271939] [2022-07-12 03:15:10,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:10,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:15:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:15:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=286, Unknown=4, NotChecked=148, Total=506 [2022-07-12 03:15:10,744 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 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) [2022-07-12 03:15:10,796 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-12 03:15:10,799 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-12 03:15:10,808 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-12 03:15:11,811 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-07-12 03:15:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:11,860 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-07-12 03:15:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:15:11,860 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 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 [2022-07-12 03:15:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:11,861 INFO L225 Difference]: With dead ends: 78 [2022-07-12 03:15:11,861 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 03:15:11,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=94, Invalid=350, Unknown=8, NotChecked=360, Total=812 [2022-07-12 03:15:11,862 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 61 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:11,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 211 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 157 Invalid, 0 Unknown, 183 Unchecked, 0.1s Time] [2022-07-12 03:15:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 03:15:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-07-12 03:15:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-07-12 03:15:11,865 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 24 [2022-07-12 03:15:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:11,865 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-07-12 03:15:11,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 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) [2022-07-12 03:15:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-07-12 03:15:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:15:11,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:11,866 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:11,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:12,083 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 [2022-07-12 03:15:12,084 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1529551183, now seen corresponding path program 2 times [2022-07-12 03:15:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:12,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470048137] [2022-07-12 03:15:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:12,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470048137] [2022-07-12 03:15:12,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470048137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:12,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465053398] [2022-07-12 03:15:12,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:15:12,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:12,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:12,184 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) [2022-07-12 03:15:12,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 03:15:12,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:15:12,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:12,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 03:15:12,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:12,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:12,290 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:12,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:12,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:12,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:12,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:12,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:12,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:12,412 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:15:12,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 03:15:12,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:12,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:13,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-12 03:15:13,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-12 03:15:13,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-12 03:15:13,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_544)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-12 03:15:13,354 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:13,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 95 treesize of output 61 [2022-07-12 03:15:13,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:13,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 547 treesize of output 537 [2022-07-12 03:15:13,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 535 treesize of output 503 [2022-07-12 03:15:13,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-12 03:15:13,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:13,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 285 treesize of output 275 [2022-07-12 03:15:14,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 275 treesize of output 259 [2022-07-12 03:15:14,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:14,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 406 treesize of output 388 [2022-07-12 03:15:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-12 03:15:14,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465053398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:14,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:14,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2022-07-12 03:15:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800321254] [2022-07-12 03:15:14,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:14,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 03:15:14,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:14,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 03:15:14,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=517, Unknown=4, NotChecked=196, Total=812 [2022-07-12 03:15:14,733 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 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) [2022-07-12 03:15:14,801 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-12 03:15:14,804 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-12 03:15:14,810 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0))))) is different from false [2022-07-12 03:15:16,832 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-07-12 03:15:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:16,915 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-07-12 03:15:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:15:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 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 24 [2022-07-12 03:15:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:16,916 INFO L225 Difference]: With dead ends: 81 [2022-07-12 03:15:16,916 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 03:15:16,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=130, Invalid=650, Unknown=8, NotChecked=472, Total=1260 [2022-07-12 03:15:16,917 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:16,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 190 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 236 Unchecked, 0.1s Time] [2022-07-12 03:15:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 03:15:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2022-07-12 03:15:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-07-12 03:15:16,920 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 24 [2022-07-12 03:15:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:16,920 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-07-12 03:15:16,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 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) [2022-07-12 03:15:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-07-12 03:15:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:15:16,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:16,921 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] [2022-07-12 03:15:16,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:17,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 03:15:17,138 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:17,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:17,138 INFO L85 PathProgramCache]: Analyzing trace with hash 17470058, now seen corresponding path program 3 times [2022-07-12 03:15:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:17,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488812388] [2022-07-12 03:15:17,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488812388] [2022-07-12 03:15:17,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488812388] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871088398] [2022-07-12 03:15:17,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:15:17,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:17,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:17,328 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:15:17,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 03:15:17,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 03:15:17,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:17,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 03:15:17,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:17,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,451 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:17,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,510 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:17,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:17,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 03:15:17,578 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:17,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:17,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:17,668 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:15:17,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 72 [2022-07-12 03:15:17,688 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-12 03:15:17,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 70 [2022-07-12 03:15:17,699 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-12 03:15:17,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 34 [2022-07-12 03:15:17,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-12 03:15:17,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 57 [2022-07-12 03:15:17,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 45 [2022-07-12 03:15:17,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 33 [2022-07-12 03:15:18,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 117 treesize of output 93 [2022-07-12 03:15:18,024 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-12 03:15:18,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 81 [2022-07-12 03:15:18,208 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:18,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:18,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:20,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= 2 .cse0) (= 3 .cse0)))) (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-12 03:15:20,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_635 Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_635)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_86| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_86|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 3) (= .cse0 2) (not (= 2 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) is different from false [2022-07-12 03:15:20,436 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-07-12 03:15:20,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1856 treesize of output 1794 [2022-07-12 03:15:20,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:20,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 823 treesize of output 726 [2022-07-12 03:15:21,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:21,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:21,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:21,741 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse50 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse49 (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse8 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (let ((.cse13 (and (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse51) (= .cse51 0) (= .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse52 0) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse53) (= .cse53 0) (= .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse54 0) (= .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (.cse4 (not .cse49)) (.cse5 (not .cse50)) (.cse14 (and .cse49 .cse50))) (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse1) (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse2) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (or .cse4 .cse5 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse6) (= .cse6 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse7) (= .cse7 0)))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8))) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse9) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse10) (= .cse10 0) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse8) (or (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse12) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse8) (or .cse13 .cse14) (or .cse14 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse15) (= .cse15 0) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse16) (= .cse16 0) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse17) (= .cse17 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse19) (= .cse19 0) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse20) (= .cse20 0) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse21) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse25 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25)) (.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse23) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse24) (= .cse24 0) (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse26 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse27) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse4 .cse5) (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse28) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or .cse13 .cse4 .cse5) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse29 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse30) (not (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 0) (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))))))) .cse8) (or .cse14 (and (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 0) (not (= .cse32 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse34) (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_ArrVal_640 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 0) (not (= .cse35 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse37) (= .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse37 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_640 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse38 0) (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse38 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (or .cse8 (forall ((v_ArrVal_634 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse39) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40)) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))))) (or .cse4 (and (or (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse41) (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse8) (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse42) (= .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse5) (or (and (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse43) (= .cse43 0) (= .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse44) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse45) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse46) (= .cse46 0) (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse47) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse48) (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse14)))) is different from false [2022-07-12 03:15:22,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:22,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 [2022-07-12 03:15:22,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:22,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 [2022-07-12 03:15:22,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 31 [2022-07-12 03:15:22,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 129 treesize of output 126 [2022-07-12 03:15:22,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 107 treesize of output 91 [2022-07-12 03:15:22,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 57 [2022-07-12 03:15:22,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:22,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,701 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:22,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 [2022-07-12 03:15:22,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,737 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,746 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,752 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,756 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:15:22,763 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,771 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,790 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,796 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,800 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:15:22,808 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,816 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:22,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:22,821 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:15:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-12 03:15:22,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871088398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:22,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:22,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2022-07-12 03:15:22,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943464043] [2022-07-12 03:15:22,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:22,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 03:15:22,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:22,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 03:15:22,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=779, Unknown=3, NotChecked=174, Total=1056 [2022-07-12 03:15:22,965 INFO L87 Difference]: Start difference. First operand 51 states and 60 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) [2022-07-12 03:15:23,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse52 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse51 (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse8 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (let ((.cse13 (and (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse53) (= .cse53 0) (= .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse54 0) (= .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse55) (= .cse55 0) (= .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse56 0) (= .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse4 (not .cse51)) (.cse5 (not .cse52)) (.cse30 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse14 (and .cse51 .cse52))) (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse1) (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse2) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (= .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (or .cse4 .cse5 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse6) (= .cse6 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse7) (= .cse7 0)))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8))) (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11)) (.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse9) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse10) (= .cse10 0) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse8) (or (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse12) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse8) (or .cse13 .cse14) (not (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse14 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse16) (= .cse16 0) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse17) (= .cse17 0) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse18) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse20) (= .cse20 0) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_640 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse21) (= .cse21 0) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse22) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse26 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26)) (.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse24) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse25) (= .cse25 0) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse27 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse27))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse27)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse28) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse4 .cse5) (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse29) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or .cse13 .cse4 .cse5) (= .cse30 0) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse32) (not (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 0) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse33 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))))))) .cse8) (or .cse14 (and (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 0) (not (= .cse34 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse36) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_ArrVal_640 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse37 0) (not (= .cse37 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|))))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse39) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_640 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) .cse5 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse40 0) (= .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse40 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (or .cse8 (forall ((v_ArrVal_634 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse42 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse42))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse41) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse42)) (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))))) .cse8 (or .cse4 (and (or (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse43) (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse8) (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_86| Int) (v_ArrVal_637 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse44) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse5) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.offset|) (or (and (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse45) (= .cse45 0) (= .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse46) (= .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse47) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse8) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse48) (= .cse48 0) (= .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_86| .cse49) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_86| Int)) (or (forall ((v_ArrVal_640 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse50) (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_86| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_634) |v_ULTIMATE.start_main_~p~0#1.base_86| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= 0 (select v_arrayElimArr_12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) .cse14)))) is different from false [2022-07-12 03:15:25,413 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse3 (= (select (select |c_#memory_int| .cse0) .cse4) 2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) (+ .cse4 4)))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (let ((.cse2 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (and (not (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse2) .cse3))) (= .cse4 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse5 (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_637) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_640) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (or (= 2 .cse5) (= 3 .cse5)))) (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) .cse3 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1)))) is different from false [2022-07-12 03:15:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:25,869 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-07-12 03:15:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 03:15:25,869 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 [2022-07-12 03:15:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:25,870 INFO L225 Difference]: With dead ends: 69 [2022-07-12 03:15:25,870 INFO L226 Difference]: Without dead ends: 65 [2022-07-12 03:15:25,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=204, Invalid=1608, Unknown=14, NotChecked=430, Total=2256 [2022-07-12 03:15:25,871 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:25,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 243 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 290 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2022-07-12 03:15:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-12 03:15:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-07-12 03:15:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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) [2022-07-12 03:15:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-07-12 03:15:25,875 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 26 [2022-07-12 03:15:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:25,876 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-12 03:15:25,876 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) [2022-07-12 03:15:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-07-12 03:15:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:15:25,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:25,877 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] [2022-07-12 03:15:25,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:26,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 03:15:26,083 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1042173034, now seen corresponding path program 2 times [2022-07-12 03:15:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:26,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033904696] [2022-07-12 03:15:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:26,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033904696] [2022-07-12 03:15:26,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033904696] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:26,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463031958] [2022-07-12 03:15:26,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:15:26,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:26,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:26,197 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:15:26,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 03:15:26,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:15:26,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:26,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 03:15:26,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:26,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:26,328 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:26,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:26,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:26,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:26,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:26,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:26,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:26,399 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:15:26,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 03:15:26,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:26,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 23 [2022-07-12 03:15:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:26,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:27,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-12 03:15:27,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-12 03:15:27,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-12 03:15:27,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_719 Int)) (not (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_719)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_722))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-07-12 03:15:27,535 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:27,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 41 [2022-07-12 03:15:27,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:27,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 295 treesize of output 301 [2022-07-12 03:15:27,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 254 [2022-07-12 03:15:27,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-12 03:15:27,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:27,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 26 [2022-07-12 03:15:27,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-12 03:15:27,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-12 03:15:27,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-12 03:15:27,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 66 [2022-07-12 03:15:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-12 03:15:27,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463031958] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:27,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:27,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2022-07-12 03:15:27,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589431248] [2022-07-12 03:15:27,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:27,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 03:15:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 03:15:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=225, Unknown=4, NotChecked=132, Total=420 [2022-07-12 03:15:27,716 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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) [2022-07-12 03:15:28,193 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2022-07-12 03:15:28,197 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2022-07-12 03:15:28,199 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:29,403 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:29,444 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2022-07-12 03:15:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:15:29,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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 [2022-07-12 03:15:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:29,445 INFO L225 Difference]: With dead ends: 105 [2022-07-12 03:15:29,445 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 03:15:29,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=85, Invalid=281, Unknown=8, NotChecked=328, Total=702 [2022-07-12 03:15:29,446 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 79 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:29,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 160 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 149 Invalid, 0 Unknown, 244 Unchecked, 0.1s Time] [2022-07-12 03:15:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 03:15:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 62. [2022-07-12 03:15:29,449 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) [2022-07-12 03:15:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-12 03:15:29,449 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 26 [2022-07-12 03:15:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:29,450 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-12 03:15:29,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 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) [2022-07-12 03:15:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-12 03:15:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:15:29,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:29,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:29,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 03:15:29,655 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1292940074, now seen corresponding path program 1 times [2022-07-12 03:15:29,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:29,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046157688] [2022-07-12 03:15:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:29,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:29,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:29,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046157688] [2022-07-12 03:15:29,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046157688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:29,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494546257] [2022-07-12 03:15:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:29,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:29,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:15:29,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 03:15:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:29,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 03:15:29,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:29,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:29,947 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:15:29,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:29,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:29,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,040 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:15:30,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-07-12 03:15:30,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:15:30,052 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:30,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,061 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:15:30,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,132 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-12 03:15:30,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,213 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 03:15:30,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,227 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-12 03:15:30,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,315 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-12 03:15:30,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,407 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:30,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:30,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:30,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:30,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:30,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:30,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2718 treesize of output 2620 [2022-07-12 03:15:30,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:30,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 932 treesize of output 845 [2022-07-12 03:15:31,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:31,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:31,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:31,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:31,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 25 [2022-07-12 03:15:31,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 29 [2022-07-12 03:15:31,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:32,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:41,683 WARN L233 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 207 DAG size of output: 174 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:15:42,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:42,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:42,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:42,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 03:15:42,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:42,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 73 [2022-07-12 03:15:42,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 46 [2022-07-12 03:15:42,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 [2022-07-12 03:15:42,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:42,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:42,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:42,998 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:42,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 26 [2022-07-12 03:15:43,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 42 [2022-07-12 03:15:43,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 50 [2022-07-12 03:15:43,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 35 [2022-07-12 03:15:43,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 [2022-07-12 03:15:43,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:43,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-07-12 03:15:43,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 42 [2022-07-12 03:15:43,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 50 [2022-07-12 03:15:43,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 35 [2022-07-12 03:15:43,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 40 [2022-07-12 03:15:43,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:43,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 16 [2022-07-12 03:15:43,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-12 03:15:43,624 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:43,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 16 [2022-07-12 03:15:43,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 [2022-07-12 03:15:43,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 45 [2022-07-12 03:15:43,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 64 [2022-07-12 03:15:43,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-07-12 03:15:43,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 41 [2022-07-12 03:15:43,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:43,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 12 [2022-07-12 03:15:43,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 17 [2022-07-12 03:15:43,779 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 42 [2022-07-12 03:15:43,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,820 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 50 [2022-07-12 03:15:43,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 35 [2022-07-12 03:15:43,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 [2022-07-12 03:15:43,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:43,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 53 [2022-07-12 03:15:43,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:43,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:43,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 66 [2022-07-12 03:15:43,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 41 [2022-07-12 03:15:43,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:43,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 03:15:44,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,047 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 [2022-07-12 03:15:44,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 31 [2022-07-12 03:15:44,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:44,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:44,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 03:15:44,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 26 [2022-07-12 03:15:44,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 [2022-07-12 03:15:44,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:44,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-12 03:15:44,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-12 03:15:44,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 [2022-07-12 03:15:44,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:44,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 31 [2022-07-12 03:15:44,378 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 26 [2022-07-12 03:15:44,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 [2022-07-12 03:15:44,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-07-12 03:15:44,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 72 [2022-07-12 03:15:44,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 treesize of output 85 [2022-07-12 03:15:44,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 48 [2022-07-12 03:15:44,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:44,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:44,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 03:15:44,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 26 [2022-07-12 03:15:44,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 53 [2022-07-12 03:15:44,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:44,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 66 [2022-07-12 03:15:44,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 41 [2022-07-12 03:15:44,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 03:15:44,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:44,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 44 [2022-07-12 03:15:44,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:44,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 46 [2022-07-12 03:15:44,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-07-12 03:15:44,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:44,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2022-07-12 03:15:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:49,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494546257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:49,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-07-12 03:15:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669803872] [2022-07-12 03:15:49,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:49,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 03:15:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:49,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 03:15:49,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=598, Unknown=2, NotChecked=0, Total=702 [2022-07-12 03:15:49,188 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:49,835 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-07-12 03:15:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 03:15:49,836 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 03:15:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:49,837 INFO L225 Difference]: With dead ends: 81 [2022-07-12 03:15:49,837 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 03:15:49,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=212, Invalid=1346, Unknown=2, NotChecked=0, Total=1560 [2022-07-12 03:15:49,838 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:49,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 204 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 317 Invalid, 0 Unknown, 203 Unchecked, 0.2s Time] [2022-07-12 03:15:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 03:15:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2022-07-12 03:15:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 63 states have internal predecessors, (75), 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) [2022-07-12 03:15:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-07-12 03:15:49,842 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 26 [2022-07-12 03:15:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:49,842 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-07-12 03:15:49,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-07-12 03:15:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:15:49,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:49,843 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] [2022-07-12 03:15:49,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 03:15:50,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 03:15:50,058 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:50,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2093251050, now seen corresponding path program 1 times [2022-07-12 03:15:50,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:50,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105407902] [2022-07-12 03:15:50,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:50,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:50,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105407902] [2022-07-12 03:15:50,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105407902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:50,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554789735] [2022-07-12 03:15:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:50,285 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:15:50,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 03:15:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:50,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 03:15:50,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:50,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,413 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:15:50,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,500 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:50,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,511 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:15:50,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:50,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,582 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-12 03:15:50,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:50,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,710 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 03:15:50,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,727 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-12 03:15:50,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,819 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-12 03:15:50,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,891 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:50,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:50,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:51,092 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:51,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:51,110 INFO L356 Elim1Store]: treesize reduction 4, result has 91.7 percent of original size [2022-07-12 03:15:51,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2468 treesize of output 2340 [2022-07-12 03:15:51,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:51,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1420 treesize of output 1283 [2022-07-12 03:15:51,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:51,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 40 [2022-07-12 03:15:51,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 37 [2022-07-12 03:15:52,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:52,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 62 [2022-07-12 03:15:52,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 31 [2022-07-12 03:15:52,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:52,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 [2022-07-12 03:15:52,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 [2022-07-12 03:15:52,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,220 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 178 treesize of output 139 [2022-07-12 03:15:52,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:52,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:52,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 [2022-07-12 03:15:52,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 [2022-07-12 03:15:52,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-07-12 03:15:52,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 171 treesize of output 132 [2022-07-12 03:15:52,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 [2022-07-12 03:15:52,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 202 [2022-07-12 03:15:52,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 293 treesize of output 194 [2022-07-12 03:15:52,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 142 treesize of output 126 [2022-07-12 03:15:52,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 76 [2022-07-12 03:15:52,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:52,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:52,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 119 [2022-07-12 03:15:52,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,584 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 245 treesize of output 194 [2022-07-12 03:15:52,593 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 80 [2022-07-12 03:15:52,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:52,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:52,626 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 119 [2022-07-12 03:15:52,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:52,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 [2022-07-12 03:15:52,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-07-12 03:15:52,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:52,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 62 [2022-07-12 03:15:52,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 31 [2022-07-12 03:15:52,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-07-12 03:15:52,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 184 treesize of output 139 [2022-07-12 03:15:52,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 83 treesize of output 87 [2022-07-12 03:15:52,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:52,855 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 50 [2022-07-12 03:15:52,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 86 [2022-07-12 03:15:52,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 316 treesize of output 211 [2022-07-12 03:15:52,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:52,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:53,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:53,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 [2022-07-12 03:15:53,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:53,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-07-12 03:15:53,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:53,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 03:15:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:54,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554789735] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:54,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:54,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-07-12 03:15:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076143250] [2022-07-12 03:15:54,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:54,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 03:15:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 03:15:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-07-12 03:15:54,454 INFO L87 Difference]: Start difference. First operand 64 states and 75 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) [2022-07-12 03:15:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:54,894 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-07-12 03:15:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:15:54,894 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 [2022-07-12 03:15:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:54,895 INFO L225 Difference]: With dead ends: 76 [2022-07-12 03:15:54,895 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 03:15:54,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 03:15:54,895 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:54,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 255 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 270 Invalid, 0 Unknown, 136 Unchecked, 0.2s Time] [2022-07-12 03:15:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 03:15:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-07-12 03:15:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 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) [2022-07-12 03:15:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-07-12 03:15:54,899 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 26 [2022-07-12 03:15:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:54,899 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-07-12 03:15:54,899 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) [2022-07-12 03:15:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-07-12 03:15:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:15:54,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:54,900 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] [2022-07-12 03:15:54,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:55,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 03:15:55,115 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -342467003, now seen corresponding path program 4 times [2022-07-12 03:15:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:55,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915964081] [2022-07-12 03:15:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:55,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:55,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915964081] [2022-07-12 03:15:55,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915964081] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200963101] [2022-07-12 03:15:55,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:15:55,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:55,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:55,347 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:15:55,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 03:15:55,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:15:55,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:55,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 03:15:55,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:55,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,482 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:15:55,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,583 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:15:55,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 29 [2022-07-12 03:15:55,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,602 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:55,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,615 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-12 03:15:55,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,680 INFO L356 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-07-12 03:15:55,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,765 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 03:15:55,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,782 INFO L356 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-07-12 03:15:55,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,955 INFO L356 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-07-12 03:15:55,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:55,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:56,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:56,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:56,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 03:15:56,069 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_995)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_997) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_997))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_995) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 4)))))) is different from false [2022-07-12 03:15:56,095 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.base| (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse0 (store (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|) .cse2 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_997))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_995) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))))) (forall ((v_ArrVal_997 (Array Int Int)) (v_ArrVal_995 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_995)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_997) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (+ (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4))))))) is different from false [2022-07-12 03:15:56,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:56,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-12 03:15:56,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:56,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 48 [2022-07-12 03:15:56,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:56,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-07-12 03:15:56,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:56,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2022-07-12 03:15:56,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:56,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 82 [2022-07-12 03:15:56,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:56,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 [2022-07-12 03:15:56,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:56,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 214 treesize of output 217 [2022-07-12 03:15:56,807 INFO L356 Elim1Store]: treesize reduction 502, result has 53.2 percent of original size [2022-07-12 03:15:56,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3664 treesize of output 3717 [2022-07-12 03:15:56,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:56,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3306 treesize of output 2610 [2022-07-12 03:15:56,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2628 treesize of output 2132 [2022-07-12 03:15:57,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:57,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2178 treesize of output 1788 [2022-07-12 03:15:57,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:57,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1778 treesize of output 1718