./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/min_max.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/heap-data/min_max.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 6f3dc8ca7e9d6160ebf6e1f17d4641cf9f9e9c7a0130658f0fd8bbb7edc9643d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:38:26,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:38:26,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:38:26,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:38:26,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:38:26,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:38:26,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:38:26,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:38:26,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:38:26,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:38:26,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:38:26,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:38:26,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:38:26,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:38:26,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:38:26,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:38:26,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:38:26,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:38:26,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:38:26,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:38:26,611 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:38:26,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:38:26,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:38:26,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:38:26,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:38:26,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:38:26,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:38:26,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:38:26,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:38:26,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:38:26,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:38:26,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:38:26,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:38:26,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:38:26,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:38:26,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:38:26,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:38:26,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:38:26,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:38:26,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:38:26,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:38:26,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:38:26,626 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:38:26,651 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:38:26,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:38:26,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:38:26,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:38:26,654 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:38:26,654 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:38:26,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:38:26,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:38:26,655 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:38:26,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:38:26,656 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:38:26,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:38:26,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:38:26,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:38:26,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:38:26,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:38:26,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:38:26,657 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:38:26,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:38:26,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:38:26,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:38:26,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:38:26,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:38:26,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:38:26,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:26,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:38:26,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:38:26,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:38:26,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:38:26,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:38:26,659 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:38:26,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:38:26,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:38:26,660 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 -> 6f3dc8ca7e9d6160ebf6e1f17d4641cf9f9e9c7a0130658f0fd8bbb7edc9643d [2022-07-12 03:38:26,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:38:26,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:38:26,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:38:26,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:38:26,889 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:38:26,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/min_max.i [2022-07-12 03:38:26,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e4e31e3/40c2e39a6db04cf4bce4b0bb42e3ef3b/FLAG35f3b25a4 [2022-07-12 03:38:27,356 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:38:27,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/min_max.i [2022-07-12 03:38:27,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e4e31e3/40c2e39a6db04cf4bce4b0bb42e3ef3b/FLAG35f3b25a4 [2022-07-12 03:38:27,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e4e31e3/40c2e39a6db04cf4bce4b0bb42e3ef3b [2022-07-12 03:38:27,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:38:27,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:38:27,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:27,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:38:27,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:38:27,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:27" (1/1) ... [2022-07-12 03:38:27,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4948897b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:27, skipping insertion in model container [2022-07-12 03:38:27,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:27" (1/1) ... [2022-07-12 03:38:27,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:38:27,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:38:28,026 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/heap-data/min_max.i[23535,23548] [2022-07-12 03:38:28,029 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/heap-data/min_max.i[23590,23603] [2022-07-12 03:38:28,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:28,034 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:38:28,060 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/heap-data/min_max.i[23535,23548] [2022-07-12 03:38:28,060 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/heap-data/min_max.i[23590,23603] [2022-07-12 03:38:28,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:28,082 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:38:28,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28 WrapperNode [2022-07-12 03:38:28,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:28,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:28,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:38:28,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:38:28,089 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:38:28" (1/1) ... [2022-07-12 03:38:28,100 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:38:28" (1/1) ... [2022-07-12 03:38:28,112 INFO L137 Inliner]: procedures = 121, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-07-12 03:38:28,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:28,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:38:28,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:38:28,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:38:28,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (1/1) ... [2022-07-12 03:38:28,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (1/1) ... [2022-07-12 03:38:28,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (1/1) ... [2022-07-12 03:38:28,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (1/1) ... [2022-07-12 03:38:28,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (1/1) ... [2022-07-12 03:38:28,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (1/1) ... [2022-07-12 03:38:28,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (1/1) ... [2022-07-12 03:38:28,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:38:28,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:38:28,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:38:28,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:38:28,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (1/1) ... [2022-07-12 03:38:28,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:28,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:28,162 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:38:28,171 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:38:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:38:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:38:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:38:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:38:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:38:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:38:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:38:28,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:38:28,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:38:28,245 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:38:28,247 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:38:28,330 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:38:28,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:38:28,347 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:38:28,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:28 BoogieIcfgContainer [2022-07-12 03:38:28,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:38:28,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:38:28,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:38:28,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:38:28,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:38:27" (1/3) ... [2022-07-12 03:38:28,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66470303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:28, skipping insertion in model container [2022-07-12 03:38:28,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:28" (2/3) ... [2022-07-12 03:38:28,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66470303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:28, skipping insertion in model container [2022-07-12 03:38:28,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:28" (3/3) ... [2022-07-12 03:38:28,356 INFO L111 eAbstractionObserver]: Analyzing ICFG min_max.i [2022-07-12 03:38:28,365 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:38:28,365 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 03:38:28,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:38:28,427 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@4700197b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cdafe1f [2022-07-12 03:38:28,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 03:38:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 19 states have internal predecessors, (27), 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:38:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 03:38:28,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:28,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:28,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:28,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1825905474, now seen corresponding path program 1 times [2022-07-12 03:38:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:28,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991553819] [2022-07-12 03:38:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:28,528 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:38:28,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:28,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991553819] [2022-07-12 03:38:28,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991553819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:28,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:28,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:38:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652093185] [2022-07-12 03:38:28,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:28,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:38:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:38:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:38:28,565 INFO L87 Difference]: Start difference. First operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 19 states have internal predecessors, (27), 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:38:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:28,576 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-12 03:38:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:38:28,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-07-12 03:38:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:28,582 INFO L225 Difference]: With dead ends: 33 [2022-07-12 03:38:28,583 INFO L226 Difference]: Without dead ends: 17 [2022-07-12 03:38:28,585 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:38:28,595 INFO L413 NwaCegarLoop]: 23 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, 23 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:38:28,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-12 03:38:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-12 03:38:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 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:38:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-12 03:38:28,620 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 7 [2022-07-12 03:38:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:28,620 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-12 03:38:28,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:38:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-12 03:38:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 03:38:28,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:28,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:28,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:38:28,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash 178093936, now seen corresponding path program 1 times [2022-07-12 03:38:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:28,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716150389] [2022-07-12 03:38:28,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:28,731 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:38:28,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:28,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716150389] [2022-07-12 03:38:28,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716150389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:28,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:28,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:38:28,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236216586] [2022-07-12 03:38:28,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:28,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:38:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:28,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:38:28,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:38:28,736 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:38:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:28,768 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-07-12 03:38:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:38:28,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-12 03:38:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:28,770 INFO L225 Difference]: With dead ends: 30 [2022-07-12 03:38:28,770 INFO L226 Difference]: Without dead ends: 19 [2022-07-12 03:38:28,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:38:28,773 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:28,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-12 03:38:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-12 03:38:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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:38:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-12 03:38:28,782 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 8 [2022-07-12 03:38:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:28,784 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-12 03:38:28,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:38:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-12 03:38:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:38:28,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:28,785 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:28,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:38:28,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1651856839, now seen corresponding path program 1 times [2022-07-12 03:38:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:28,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019418250] [2022-07-12 03:38:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:28,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:28,948 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:38:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:28,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019418250] [2022-07-12 03:38:28,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019418250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:28,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:28,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:38:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787981768] [2022-07-12 03:38:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:28,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:38:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:38:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:38:28,950 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:29,027 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-07-12 03:38:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:38:29,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 03:38:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:29,028 INFO L225 Difference]: With dead ends: 28 [2022-07-12 03:38:29,028 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:38:29,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:38:29,029 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:29,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:38:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:38:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-07-12 03:38:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.263157894736842) 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:38:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-12 03:38:29,032 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-12 03:38:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:29,033 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-12 03:38:29,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-12 03:38:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:38:29,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:29,033 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:29,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:38:29,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1703602811, now seen corresponding path program 1 times [2022-07-12 03:38:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:29,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494526981] [2022-07-12 03:38:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:29,115 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:38:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:29,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494526981] [2022-07-12 03:38:29,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494526981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:29,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:29,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:38:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570846070] [2022-07-12 03:38:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:29,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:38:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:38:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:38:29,118 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:29,214 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-07-12 03:38:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:38:29,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 03:38:29,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:29,215 INFO L225 Difference]: With dead ends: 40 [2022-07-12 03:38:29,215 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 03:38:29,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:38:29,216 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:29,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 03:38:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-07-12 03:38:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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:38:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-12 03:38:29,220 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2022-07-12 03:38:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:29,221 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-12 03:38:29,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-12 03:38:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:38:29,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:29,222 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:29,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:38:29,222 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1911306115, now seen corresponding path program 1 times [2022-07-12 03:38:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:29,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717979117] [2022-07-12 03:38:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:29,263 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:38:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:29,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717979117] [2022-07-12 03:38:29,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717979117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:29,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:29,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:38:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430086904] [2022-07-12 03:38:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:29,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:38:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:38:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:38:29,266 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:29,318 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-12 03:38:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:38:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 03:38:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:29,319 INFO L225 Difference]: With dead ends: 55 [2022-07-12 03:38:29,319 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:38:29,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:38:29,320 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:29,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:38:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 03:38:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 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:38:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-12 03:38:29,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 15 [2022-07-12 03:38:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:29,324 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-12 03:38:29,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-12 03:38:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:38:29,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:29,325 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:29,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:38:29,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1682596603, now seen corresponding path program 1 times [2022-07-12 03:38:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:29,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857757357] [2022-07-12 03:38:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:29,428 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:38:29,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:29,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857757357] [2022-07-12 03:38:29,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857757357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:29,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:29,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 03:38:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669344884] [2022-07-12 03:38:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:29,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:38:29,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:38:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:38:29,430 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:29,553 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-07-12 03:38:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:38:29,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 03:38:29,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:29,553 INFO L225 Difference]: With dead ends: 36 [2022-07-12 03:38:29,553 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:38:29,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:38:29,554 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:29,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:38:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:38:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-07-12 03:38:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 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:38:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-12 03:38:29,558 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2022-07-12 03:38:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:29,558 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-12 03:38:29,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-12 03:38:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:38:29,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:29,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:29,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:38:29,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:29,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1593313461, now seen corresponding path program 1 times [2022-07-12 03:38:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:29,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324167532] [2022-07-12 03:38:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:29,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:29,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324167532] [2022-07-12 03:38:29,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324167532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:29,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689410664] [2022-07-12 03:38:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:29,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:29,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:29,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:38:29,668 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:38:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:29,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 03:38:29,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:29,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:38:29,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:38:29,887 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:38:29,898 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:38:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:29,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:29,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689410664] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:29,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:29,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-07-12 03:38:29,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884387232] [2022-07-12 03:38:29,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:29,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:38:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:38:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:38:29,970 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:30,083 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-07-12 03:38:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:38:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 03:38:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:30,084 INFO L225 Difference]: With dead ends: 46 [2022-07-12 03:38:30,084 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 03:38:30,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:38:30,085 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 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:38:30,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 03:38:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-12 03:38:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-12 03:38:30,090 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2022-07-12 03:38:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:30,090 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-12 03:38:30,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-12 03:38:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:38:30,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:30,091 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:30,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:30,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:30,308 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:30,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1667695916, now seen corresponding path program 2 times [2022-07-12 03:38:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:30,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514518912] [2022-07-12 03:38:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:30,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514518912] [2022-07-12 03:38:30,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514518912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:30,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171232219] [2022-07-12 03:38:30,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:38:30,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:30,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:30,396 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:38:30,428 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:38:30,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:38:30,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:30,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:38:30,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:30,611 INFO L356 Elim1Store]: treesize reduction 77, result has 31.9 percent of original size [2022-07-12 03:38:30,612 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 2 case distinctions, treesize of input 35 treesize of output 49 [2022-07-12 03:38:30,646 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 19 treesize of output 7 [2022-07-12 03:38:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:30,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:30,715 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 19 treesize of output 7 [2022-07-12 03:38:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:30,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171232219] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:30,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:30,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-07-12 03:38:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859253141] [2022-07-12 03:38:30,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:30,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:38:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:38:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:38:30,723 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:30,906 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2022-07-12 03:38:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:38:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 03:38:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:30,908 INFO L225 Difference]: With dead ends: 109 [2022-07-12 03:38:30,908 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 03:38:30,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-07-12 03:38:30,909 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 93 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:30,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 115 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-07-12 03:38:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 03:38:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2022-07-12 03:38:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 43 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:38:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-07-12 03:38:30,914 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2022-07-12 03:38:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:30,914 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-07-12 03:38:30,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-07-12 03:38:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:38:30,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:30,915 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:30,942 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:38:31,131 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,SelfDestructingSolverStorable7 [2022-07-12 03:38:31,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1409530478, now seen corresponding path program 1 times [2022-07-12 03:38:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:31,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068186226] [2022-07-12 03:38:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068186226] [2022-07-12 03:38:31,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068186226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:31,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481441522] [2022-07-12 03:38:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:31,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:31,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:31,476 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:38:31,477 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:38:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:31,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 03:38:31,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:31,554 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:38:31,632 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:38:31,637 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:38:31,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:31,641 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 18 treesize of output 20 [2022-07-12 03:38:31,647 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:31,647 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 15 treesize of output 15 [2022-07-12 03:38:31,755 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 27 treesize of output 15 [2022-07-12 03:38:31,758 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 15 treesize of output 7 [2022-07-12 03:38:31,798 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:38:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:31,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:31,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_13| Int)) (or (<= |c_ULTIMATE.start_main_~min~0#1| (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_13| v_ArrVal_195) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_13|) 0)))) is different from false [2022-07-12 03:38:31,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_13|) 0)) (<= |c_ULTIMATE.start_main_#t~mem6#1| (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_13| v_ArrVal_195) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-12 03:38:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-12 03:38:31,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481441522] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:31,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:31,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 24 [2022-07-12 03:38:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288650701] [2022-07-12 03:38:31,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:31,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 03:38:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 03:38:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=411, Unknown=2, NotChecked=82, Total=552 [2022-07-12 03:38:31,921 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 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:38:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:34,460 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2022-07-12 03:38:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 03:38:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 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 23 [2022-07-12 03:38:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:34,464 INFO L225 Difference]: With dead ends: 203 [2022-07-12 03:38:34,464 INFO L226 Difference]: Without dead ends: 201 [2022-07-12 03:38:34,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=573, Invalid=2625, Unknown=2, NotChecked=222, Total=3422 [2022-07-12 03:38:34,466 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 355 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:34,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 156 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 459 Invalid, 0 Unknown, 105 Unchecked, 0.4s Time] [2022-07-12 03:38:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-12 03:38:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 70. [2022-07-12 03:38:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 69 states have internal predecessors, (87), 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:38:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-07-12 03:38:34,477 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 23 [2022-07-12 03:38:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:34,477 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-07-12 03:38:34,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 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:38:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-07-12 03:38:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:38:34,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:34,479 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:34,505 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:38:34,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:34,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:34,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1032365076, now seen corresponding path program 1 times [2022-07-12 03:38:34,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:34,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116550776] [2022-07-12 03:38:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:34,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:34,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116550776] [2022-07-12 03:38:34,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116550776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:34,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802141178] [2022-07-12 03:38:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:34,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:34,758 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:38:34,759 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:38:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:34,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:38:34,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:34,868 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 19 treesize of output 7 [2022-07-12 03:38:34,898 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 21 treesize of output 9 [2022-07-12 03:38:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:34,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:34,942 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 19 treesize of output 7 [2022-07-12 03:38:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:34,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802141178] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:34,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:34,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-12 03:38:34,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559386718] [2022-07-12 03:38:34,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:34,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:38:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:34,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:38:34,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:38:34,977 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:35,104 INFO L93 Difference]: Finished difference Result 197 states and 236 transitions. [2022-07-12 03:38:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:38:35,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 03:38:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:35,105 INFO L225 Difference]: With dead ends: 197 [2022-07-12 03:38:35,105 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 03:38:35,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-07-12 03:38:35,106 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 127 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:35,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 94 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:38:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 03:38:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 80. [2022-07-12 03:38:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 79 states have internal predecessors, (102), 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:38:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2022-07-12 03:38:35,113 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 23 [2022-07-12 03:38:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:35,113 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2022-07-12 03:38:35,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-07-12 03:38:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:38:35,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:35,114 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:35,134 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:38:35,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:35,331 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1290530514, now seen corresponding path program 1 times [2022-07-12 03:38:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:35,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153571008] [2022-07-12 03:38:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:35,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:35,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153571008] [2022-07-12 03:38:35,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153571008] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:35,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306662828] [2022-07-12 03:38:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:35,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:35,487 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:38:35,488 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:38:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:35,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 03:38:35,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:35,584 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:38:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:38:35,631 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:38:35,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:35,636 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 18 treesize of output 20 [2022-07-12 03:38:35,644 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:35,644 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 15 treesize of output 15 [2022-07-12 03:38:35,803 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:38:35,807 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 23 treesize of output 15 [2022-07-12 03:38:35,845 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:38:35,845 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 26 treesize of output 14 [2022-07-12 03:38:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:35,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:35,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_17| Int)) (let ((.cse0 (select v_ArrVal_303 4))) (or (<= |c_ULTIMATE.start_main_~min~0#1| .cse0) (<= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_17| v_ArrVal_303) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_17|) 0))))) is different from false [2022-07-12 03:38:36,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:36,020 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:38:36,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:36,028 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:38:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 03:38:36,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306662828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:36,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:36,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2022-07-12 03:38:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270839978] [2022-07-12 03:38:36,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:36,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:38:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:36,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:38:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=398, Unknown=1, NotChecked=40, Total=506 [2022-07-12 03:38:36,123 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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:38:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:36,629 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2022-07-12 03:38:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:38:36,630 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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 23 [2022-07-12 03:38:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:36,630 INFO L225 Difference]: With dead ends: 112 [2022-07-12 03:38:36,630 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 03:38:36,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=799, Unknown=1, NotChecked=60, Total=1056 [2022-07-12 03:38:36,631 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 90 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:36,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 190 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 224 Invalid, 0 Unknown, 81 Unchecked, 0.1s Time] [2022-07-12 03:38:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 03:38:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 54. [2022-07-12 03:38:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 53 states have internal predecessors, (66), 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:38:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-07-12 03:38:36,640 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 23 [2022-07-12 03:38:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:36,640 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-07-12 03:38:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 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:38:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-07-12 03:38:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:38:36,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:36,641 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:36,666 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:38:36,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 03:38:36,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1643965548, now seen corresponding path program 1 times [2022-07-12 03:38:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:36,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399311776] [2022-07-12 03:38:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:36,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399311776] [2022-07-12 03:38:36,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399311776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612990808] [2022-07-12 03:38:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:36,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:36,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:36,952 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:38:36,953 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:38:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:37,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 03:38:37,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:37,017 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:38:37,063 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:38:37,070 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:38:37,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:37,074 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 18 treesize of output 20 [2022-07-12 03:38:37,079 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:37,079 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 15 treesize of output 15 [2022-07-12 03:38:37,160 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 27 treesize of output 15 [2022-07-12 03:38:37,163 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 15 treesize of output 7 [2022-07-12 03:38:37,181 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:38:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:37,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:37,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_363 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_20| Int)) (or (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_20| v_ArrVal_363) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) |c_ULTIMATE.start_main_~max~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_20|) 0)))) is different from false [2022-07-12 03:38:37,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:37,236 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:38:37,239 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:38:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:38:37,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612990808] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:37,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:37,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2022-07-12 03:38:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775882106] [2022-07-12 03:38:37,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:37,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 03:38:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:37,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 03:38:37,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=203, Unknown=1, NotChecked=28, Total=272 [2022-07-12 03:38:37,291 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 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:38:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:37,639 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-07-12 03:38:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:38:37,640 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 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 25 [2022-07-12 03:38:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:37,641 INFO L225 Difference]: With dead ends: 111 [2022-07-12 03:38:37,641 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 03:38:37,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=466, Unknown=1, NotChecked=46, Total=650 [2022-07-12 03:38:37,641 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 98 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:37,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 118 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 224 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-07-12 03:38:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 03:38:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 82. [2022-07-12 03:38:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.2625) internal successors, (101), 81 states have internal predecessors, (101), 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:38:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-07-12 03:38:37,650 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 25 [2022-07-12 03:38:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:37,650 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-07-12 03:38:37,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 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:38:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-07-12 03:38:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:38:37,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:37,651 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:37,685 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:38:37,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:37,867 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1055550124, now seen corresponding path program 1 times [2022-07-12 03:38:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:37,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799159646] [2022-07-12 03:38:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:37,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:38,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799159646] [2022-07-12 03:38:38,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799159646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442260888] [2022-07-12 03:38:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:38,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:38,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:38,070 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:38:38,092 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:38:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:38,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 03:38:38,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:38,148 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:38:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:38:38,192 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:38:38,198 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:38:38,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:38,201 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 18 treesize of output 20 [2022-07-12 03:38:38,208 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:38,208 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 15 treesize of output 15 [2022-07-12 03:38:38,367 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 23 treesize of output 15 [2022-07-12 03:38:38,369 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:38:38,412 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:38:38,412 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 26 treesize of output 14 [2022-07-12 03:38:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:38,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:38,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_23| Int)) (let ((.cse0 (select v_ArrVal_419 4))) (or (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_23|) 0)) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_23| v_ArrVal_419) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0)))) is different from false [2022-07-12 03:38:38,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_23| Int)) (let ((.cse0 (select v_ArrVal_419 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_23|) 0)) (<= .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_23| v_ArrVal_419) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0)))) is different from false [2022-07-12 03:38:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-12 03:38:38,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442260888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:38,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:38,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 26 [2022-07-12 03:38:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215581696] [2022-07-12 03:38:38,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:38,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 03:38:38,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:38,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 03:38:38,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=477, Unknown=2, NotChecked=90, Total=650 [2022-07-12 03:38:38,607 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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:38:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:39,642 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2022-07-12 03:38:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 03:38:39,643 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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 25 [2022-07-12 03:38:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:39,643 INFO L225 Difference]: With dead ends: 133 [2022-07-12 03:38:39,643 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 03:38:39,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=1396, Unknown=2, NotChecked=162, Total=1892 [2022-07-12 03:38:39,645 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 106 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:39,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 260 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 480 Invalid, 0 Unknown, 154 Unchecked, 0.3s Time] [2022-07-12 03:38:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 03:38:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 84. [2022-07-12 03:38:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 83 states have internal predecessors, (104), 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:38:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2022-07-12 03:38:39,654 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 25 [2022-07-12 03:38:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:39,654 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2022-07-12 03:38:39,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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:38:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2022-07-12 03:38:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:38:39,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:39,655 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:39,678 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:38:39,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:39,862 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:39,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1550473430, now seen corresponding path program 1 times [2022-07-12 03:38:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:39,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762803764] [2022-07-12 03:38:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762803764] [2022-07-12 03:38:40,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762803764] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:40,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177226466] [2022-07-12 03:38:40,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:40,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:40,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:40,095 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:38:40,096 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:38:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:40,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 03:38:40,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:40,180 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:38:40,220 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:38:40,228 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:38:40,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:40,232 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 18 treesize of output 20 [2022-07-12 03:38:40,239 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:40,239 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 15 treesize of output 15 [2022-07-12 03:38:40,421 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 31 treesize of output 19 [2022-07-12 03:38:40,424 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 15 treesize of output 7 [2022-07-12 03:38:40,481 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 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-12 03:38:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:40,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:40,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_26| Int)) (let ((.cse0 (select v_ArrVal_480 4))) (or (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_26| v_ArrVal_480) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_26|) 0)) (< .cse0 |c_ULTIMATE.start_main_~min~0#1|)))) is different from false [2022-07-12 03:38:40,692 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:40,693 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:38:40,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:40,699 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:38:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 03:38:40,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177226466] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:40,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:40,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2022-07-12 03:38:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741644274] [2022-07-12 03:38:40,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:40,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 03:38:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 03:38:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=630, Unknown=1, NotChecked=50, Total=756 [2022-07-12 03:38:40,787 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 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:38:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:43,757 INFO L93 Difference]: Finished difference Result 319 states and 367 transitions. [2022-07-12 03:38:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-12 03:38:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 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 25 [2022-07-12 03:38:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:43,758 INFO L225 Difference]: With dead ends: 319 [2022-07-12 03:38:43,758 INFO L226 Difference]: Without dead ends: 317 [2022-07-12 03:38:43,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=732, Invalid=3559, Unknown=3, NotChecked=128, Total=4422 [2022-07-12 03:38:43,759 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 180 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:43,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 547 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1087 Invalid, 0 Unknown, 243 Unchecked, 0.6s Time] [2022-07-12 03:38:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-12 03:38:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 99. [2022-07-12 03:38:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 98 states have internal predecessors, (126), 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:38:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2022-07-12 03:38:43,769 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 25 [2022-07-12 03:38:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:43,769 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2022-07-12 03:38:43,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 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:38:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2022-07-12 03:38:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:38:43,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:43,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:43,788 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:38:43,980 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,SelfDestructingSolverStorable13 [2022-07-12 03:38:43,980 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash 138316690, now seen corresponding path program 2 times [2022-07-12 03:38:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:43,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665683169] [2022-07-12 03:38:43,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:44,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665683169] [2022-07-12 03:38:44,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665683169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:44,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434793850] [2022-07-12 03:38:44,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:38:44,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:44,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:44,090 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:38:44,090 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:38:44,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:38:44,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:44,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 03:38:44,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:44,178 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:38:44,181 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:38:44,186 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:38:44,229 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:38:44,233 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:38:44,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:44,237 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 16 treesize of output 18 [2022-07-12 03:38:44,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:38:44,248 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:44,249 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 15 treesize of output 15 [2022-07-12 03:38:44,435 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-12 03:38:44,436 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 61 treesize of output 35 [2022-07-12 03:38:44,442 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:38:44,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:38:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:44,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:44,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:44,496 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 13 treesize of output 17 [2022-07-12 03:38:44,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:44,502 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 13 treesize of output 17 [2022-07-12 03:38:44,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:44,602 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 24 treesize of output 23 [2022-07-12 03:38:44,604 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 12 treesize of output 10 [2022-07-12 03:38:44,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:44,607 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 20 treesize of output 8 [2022-07-12 03:38:44,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:44,611 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 18 treesize of output 19 [2022-07-12 03:38:44,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:44,614 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 16 treesize of output 8 [2022-07-12 03:38:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:44,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434793850] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:44,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:44,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2022-07-12 03:38:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648746177] [2022-07-12 03:38:44,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:44,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 03:38:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 03:38:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-12 03:38:44,619 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:44,779 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2022-07-12 03:38:44,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:38:44,779 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 03:38:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:44,780 INFO L225 Difference]: With dead ends: 138 [2022-07-12 03:38:44,780 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 03:38:44,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-07-12 03:38:44,781 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:44,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 142 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2022-07-12 03:38:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 03:38:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-12 03:38:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 116 states have internal predecessors, (147), 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:38:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2022-07-12 03:38:44,790 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 28 [2022-07-12 03:38:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:44,791 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2022-07-12 03:38:44,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2022-07-12 03:38:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:38:44,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:44,791 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:44,810 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:38:45,007 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,SelfDestructingSolverStorable14 [2022-07-12 03:38:45,007 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2085718163, now seen corresponding path program 2 times [2022-07-12 03:38:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:45,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670619345] [2022-07-12 03:38:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:45,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:45,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670619345] [2022-07-12 03:38:45,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670619345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:45,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462538628] [2022-07-12 03:38:45,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:38:45,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:45,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:45,241 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:38:45,256 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:38:45,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:38:45,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:45,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 03:38:45,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:45,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:38:45,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,403 INFO L356 Elim1Store]: treesize reduction 56, result has 31.7 percent of original size [2022-07-12 03:38:45,403 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 35 treesize of output 49 [2022-07-12 03:38:45,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:38:45,461 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:38:45,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,465 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 18 treesize of output 20 [2022-07-12 03:38:45,471 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:45,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 15 treesize of output 15 [2022-07-12 03:38:45,591 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 27 treesize of output 15 [2022-07-12 03:38:45,594 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 15 treesize of output 7 [2022-07-12 03:38:45,626 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:38:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:45,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:45,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_34| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_34|) 0)) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_34| v_ArrVal_629) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) |c_ULTIMATE.start_main_~max~0#1|))) is different from false [2022-07-12 03:38:45,749 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 10 treesize of output 8 [2022-07-12 03:38:45,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_35| Int) (|v_ULTIMATE.start_main_~l~0#1.base_34| Int) (v_ArrVal_624 Int) (v_ArrVal_623 Int)) (or (= |v_ULTIMATE.start_main_~l~0#1.base_35| |v_ULTIMATE.start_main_~l~0#1.base_34|) (< 2147483647 v_ArrVal_624) (<= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_35| (store (store (select |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_35|) 4 v_ArrVal_624) 0 v_ArrVal_623)) |v_ULTIMATE.start_main_~l~0#1.base_34| v_ArrVal_629) |v_ULTIMATE.start_main_~l~0#1.base_35|) 4) |c_ULTIMATE.start_main_~max~0#1|))) is different from false [2022-07-12 03:38:45,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_35| Int) (|v_ULTIMATE.start_main_~l~0#1.base_34| Int) (v_ArrVal_624 Int) (v_ArrVal_623 Int)) (or (= |v_ULTIMATE.start_main_~l~0#1.base_35| |v_ULTIMATE.start_main_~l~0#1.base_34|) (< 2147483647 v_ArrVal_624) (<= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_35| (store (store (select |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_35|) 4 v_ArrVal_624) 0 v_ArrVal_623)) |v_ULTIMATE.start_main_~l~0#1.base_34| v_ArrVal_629) |v_ULTIMATE.start_main_~l~0#1.base_35|) 4) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))) is different from false [2022-07-12 03:38:45,861 INFO L356 Elim1Store]: treesize reduction 51, result has 48.5 percent of original size [2022-07-12 03:38:45,861 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 61 [2022-07-12 03:38:45,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:45,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:45,871 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 46 treesize of output 45 [2022-07-12 03:38:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-07-12 03:38:45,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462538628] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:45,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:45,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-07-12 03:38:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443492872] [2022-07-12 03:38:45,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:45,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 03:38:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 03:38:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=634, Unknown=3, NotChecked=156, Total=870 [2022-07-12 03:38:45,881 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 30 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 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:38:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:51,672 INFO L93 Difference]: Finished difference Result 309 states and 357 transitions. [2022-07-12 03:38:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-07-12 03:38:51,672 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 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 30 [2022-07-12 03:38:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:51,676 INFO L225 Difference]: With dead ends: 309 [2022-07-12 03:38:51,676 INFO L226 Difference]: Without dead ends: 307 [2022-07-12 03:38:51,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1859, Invalid=8248, Unknown=5, NotChecked=600, Total=10712 [2022-07-12 03:38:51,679 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 526 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:51,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 191 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 547 Invalid, 0 Unknown, 302 Unchecked, 0.4s Time] [2022-07-12 03:38:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-12 03:38:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 120. [2022-07-12 03:38:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 119 states have internal predecessors, (152), 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:38:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2022-07-12 03:38:51,696 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 30 [2022-07-12 03:38:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:51,697 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2022-07-12 03:38:51,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7) internal successors, (81), 30 states have internal predecessors, (81), 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:38:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2022-07-12 03:38:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:38:51,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:51,698 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:51,715 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:38:51,911 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,SelfDestructingSolverStorable15 [2022-07-12 03:38:51,911 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:51,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1136640527, now seen corresponding path program 2 times [2022-07-12 03:38:51,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:51,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784186525] [2022-07-12 03:38:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:51,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:52,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:52,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784186525] [2022-07-12 03:38:52,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784186525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:52,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850263804] [2022-07-12 03:38:52,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:38:52,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:52,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:52,193 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:38:52,194 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:38:52,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:38:52,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:52,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 03:38:52,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:52,301 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:38:52,363 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:38:52,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:52,374 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 18 treesize of output 20 [2022-07-12 03:38:52,380 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:52,381 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 15 treesize of output 15 [2022-07-12 03:38:52,390 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:38:52,557 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 23 treesize of output 15 [2022-07-12 03:38:52,560 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:38:52,608 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:38:52,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 26 treesize of output 14 [2022-07-12 03:38:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:52,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:52,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_39| Int)) (let ((.cse0 (select v_ArrVal_712 4))) (or (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_39| v_ArrVal_712) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_39|) 0))))) is different from false [2022-07-12 03:38:52,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_39| Int)) (let ((.cse0 (select v_ArrVal_712 4))) (or (<= .cse0 |c_ULTIMATE.start_main_#t~mem8#1|) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_39| v_ArrVal_712) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_39|) 0))))) is different from false [2022-07-12 03:38:52,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:52,818 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:38:52,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:52,824 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:38:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-12 03:38:52,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850263804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:52,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:52,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 32 [2022-07-12 03:38:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174016080] [2022-07-12 03:38:52,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:52,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 03:38:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:52,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 03:38:52,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=776, Unknown=2, NotChecked=114, Total=992 [2022-07-12 03:38:52,916 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 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:38:53,433 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_39| Int)) (let ((.cse0 (select v_ArrVal_712 4))) (or (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_39| v_ArrVal_712) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_39|) 0))))) (<= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) |c_ULTIMATE.start_main_~min~0#1|) (<= 0 |c_ULTIMATE.start_main_~p~0#1.offset|)) is different from false [2022-07-12 03:38:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:56,018 INFO L93 Difference]: Finished difference Result 383 states and 441 transitions. [2022-07-12 03:38:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-07-12 03:38:56,019 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 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 30 [2022-07-12 03:38:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:56,020 INFO L225 Difference]: With dead ends: 383 [2022-07-12 03:38:56,020 INFO L226 Difference]: Without dead ends: 366 [2022-07-12 03:38:56,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1186, Invalid=7192, Unknown=6, NotChecked=546, Total=8930 [2022-07-12 03:38:56,023 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 279 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:56,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 415 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 989 Invalid, 0 Unknown, 312 Unchecked, 0.6s Time] [2022-07-12 03:38:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-12 03:38:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 107. [2022-07-12 03:38:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.2666666666666666) internal successors, (133), 106 states have internal predecessors, (133), 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:38:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2022-07-12 03:38:56,040 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 30 [2022-07-12 03:38:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:56,040 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2022-07-12 03:38:56,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 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:38:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-07-12 03:38:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:38:56,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:56,041 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:56,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:56,252 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,SelfDestructingSolverStorable16 [2022-07-12 03:38:56,252 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1260702929, now seen corresponding path program 1 times [2022-07-12 03:38:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:56,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655735311] [2022-07-12 03:38:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:56,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:56,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655735311] [2022-07-12 03:38:56,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655735311] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:56,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817256467] [2022-07-12 03:38:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:56,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:56,557 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:38:56,574 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:38:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:56,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 03:38:56,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:56,672 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:38:56,761 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:38:56,764 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:38:56,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:56,768 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 18 treesize of output 20 [2022-07-12 03:38:56,774 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:56,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:38:56,870 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 27 treesize of output 15 [2022-07-12 03:38:56,872 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 15 treesize of output 7 [2022-07-12 03:38:56,891 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:38:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:56,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:56,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_42| Int) (v_ArrVal_797 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_42|) 0)) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_42| v_ArrVal_797) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) |c_ULTIMATE.start_main_~max~0#1|))) is different from false [2022-07-12 03:38:56,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_42| Int) (v_ArrVal_797 (Array Int Int))) (or (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_42| v_ArrVal_797) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) |c_ULTIMATE.start_main_#t~mem8#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_42|) 0)))) is different from false [2022-07-12 03:38:57,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:57,008 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:38:57,011 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:38:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-12 03:38:57,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817256467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:57,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:57,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 29 [2022-07-12 03:38:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685456193] [2022-07-12 03:38:57,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:57,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 03:38:57,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:57,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 03:38:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=630, Unknown=2, NotChecked=102, Total=812 [2022-07-12 03:38:57,082 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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:38:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:58,822 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2022-07-12 03:38:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 03:38:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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) Word has length 30 [2022-07-12 03:38:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:58,823 INFO L225 Difference]: With dead ends: 165 [2022-07-12 03:38:58,823 INFO L226 Difference]: Without dead ends: 163 [2022-07-12 03:38:58,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=621, Invalid=2247, Unknown=2, NotChecked=210, Total=3080 [2022-07-12 03:38:58,824 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 179 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:58,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 174 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 505 Invalid, 0 Unknown, 86 Unchecked, 0.3s Time] [2022-07-12 03:38:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-12 03:38:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 88. [2022-07-12 03:38:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 87 states have internal predecessors, (110), 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:38:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2022-07-12 03:38:58,832 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 30 [2022-07-12 03:38:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:58,833 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2022-07-12 03:38:58,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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:38:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2022-07-12 03:38:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:38:58,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:58,833 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:58,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 03:38:59,047 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,SelfDestructingSolverStorable17 [2022-07-12 03:38:59,047 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash -334041831, now seen corresponding path program 3 times [2022-07-12 03:38:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:59,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873197139] [2022-07-12 03:38:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:59,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:59,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873197139] [2022-07-12 03:38:59,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873197139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:59,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097339505] [2022-07-12 03:38:59,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:38:59,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:59,220 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:38:59,220 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:38:59,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 03:38:59,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:59,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 03:38:59,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:59,314 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:38:59,382 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:38:59,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:59,386 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 18 treesize of output 20 [2022-07-12 03:38:59,398 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:38:59,398 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 21 treesize of output 29 [2022-07-12 03:38:59,406 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:38:59,477 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:38:59,480 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:38:59,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:59,484 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 43 treesize of output 37 [2022-07-12 03:38:59,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38: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 22 treesize of output 24 [2022-07-12 03:38:59,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:59,495 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:38:59,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:38:59,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:38:59,722 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:38:59,723 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 85 treesize of output 47 [2022-07-12 03:38:59,729 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:38:59,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:38:59,749 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:38:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:59,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:59,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:59,785 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 32 treesize of output 36 [2022-07-12 03:38:59,789 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:59,789 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 29 treesize of output 33 [2022-07-12 03:38:59,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_46| Int)) (or (<= |c_ULTIMATE.start_main_~min~0#1| (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_46| v_ArrVal_889) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_46| v_arrayElimArr_10) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_46| v_arrayElimArr_11) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_46|) 0)) (not (= (select v_arrayElimArr_10 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_11 0))))) is different from false [2022-07-12 03:38:59,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:59,835 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 62 [2022-07-12 03:38:59,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:59,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2022-07-12 03:38:59,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 60 treesize of output 48 [2022-07-12 03:38:59,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:59,844 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 32 treesize of output 33 [2022-07-12 03:38:59,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:59,847 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-07-12 03:38:59,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_889 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_46| Int) (v_arrayElimCell_114 Int) (v_ArrVal_880 (Array Int Int))) (or (not (= (select |c_#valid| v_arrayElimCell_114) 0)) (not (= (select (store |c_#valid| v_arrayElimCell_114 1) |v_ULTIMATE.start_main_~l~0#1.base_46|) 0)) (<= |c_ULTIMATE.start_main_#t~mem6#1| (select (select (store (store |c_#memory_int| v_arrayElimCell_114 v_ArrVal_880) |v_ULTIMATE.start_main_~l~0#1.base_46| v_ArrVal_889) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-12 03:38:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 03:38:59,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097339505] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:59,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:59,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 23 [2022-07-12 03:38:59,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811245848] [2022-07-12 03:38:59,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:59,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:38:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:59,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:38:59,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=369, Unknown=4, NotChecked=78, Total=506 [2022-07-12 03:38:59,918 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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:39:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:00,742 INFO L93 Difference]: Finished difference Result 151 states and 179 transitions. [2022-07-12 03:39:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:39:00,742 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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 33 [2022-07-12 03:39:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:00,742 INFO L225 Difference]: With dead ends: 151 [2022-07-12 03:39:00,743 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 03:39:00,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=960, Unknown=7, NotChecked=134, Total=1332 [2022-07-12 03:39:00,743 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 116 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:00,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 225 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 248 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2022-07-12 03:39:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 03:39:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 116. [2022-07-12 03:39:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.263157894736842) internal successors, (144), 115 states have internal predecessors, (144), 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:39:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2022-07-12 03:39:00,757 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 33 [2022-07-12 03:39:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:00,758 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2022-07-12 03:39:00,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 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:39:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2022-07-12 03:39:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:39:00,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:00,758 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:00,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:00,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:00,971 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1354901911, now seen corresponding path program 1 times [2022-07-12 03:39:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:00,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847758264] [2022-07-12 03:39:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:00,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:01,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:01,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847758264] [2022-07-12 03:39:01,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847758264] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:01,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300614803] [2022-07-12 03:39:01,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:01,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:01,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:01,182 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:01,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 03:39:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:01,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 03:39:01,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:01,289 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:39:01,330 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:39:01,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,334 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 18 treesize of output 20 [2022-07-12 03:39:01,345 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:01,346 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 21 treesize of output 29 [2022-07-12 03:39:01,353 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:39:01,418 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:01,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,423 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 43 treesize of output 37 [2022-07-12 03:39:01,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,428 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 22 treesize of output 24 [2022-07-12 03:39:01,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,437 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:01,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:01,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,443 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 23 [2022-07-12 03:39:01,446 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 8 treesize of output 7 [2022-07-12 03:39:01,707 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:01,708 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 77 treesize of output 47 [2022-07-12 03:39:01,713 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:01,713 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:39:02,193 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:02,193 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 26 treesize of output 14 [2022-07-12 03:39:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:02,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:02,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:02,327 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 34 treesize of output 38 [2022-07-12 03:39:02,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:02,332 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 31 treesize of output 35 [2022-07-12 03:39:02,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_51| Int) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse0 (select v_ArrVal_980 4))) (or (not (= (select v_arrayElimArr_15 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (<= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_51| v_ArrVal_980) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_51| v_arrayElimArr_15) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_51| v_arrayElimArr_16) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (<= |c_ULTIMATE.start_main_~min~0#1| .cse0) (not (= (select v_arrayElimArr_16 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_51|) 0))))) is different from false [2022-07-12 03:39:02,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:02,408 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 61 treesize of output 60 [2022-07-12 03:39:02,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:02,412 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 57 treesize of output 45 [2022-07-12 03:39:02,416 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 48 [2022-07-12 03:39:02,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:02,422 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 32 treesize of output 33 [2022-07-12 03:39:02,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:02,425 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 30 treesize of output 22 [2022-07-12 03:39:02,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_51| Int) (v_arrayElimCell_134 Int) (v_ArrVal_980 (Array Int Int)) (v_ArrVal_970 (Array Int Int))) (let ((.cse0 (select v_ArrVal_980 4))) (or (not (= (select (store |c_#valid| v_arrayElimCell_134 1) |v_ULTIMATE.start_main_~l~0#1.base_51|) 0)) (<= |c_ULTIMATE.start_main_#t~mem6#1| .cse0) (not (= (select |c_#valid| v_arrayElimCell_134) 0)) (<= .cse0 (select (select (store (store |c_#memory_int| v_arrayElimCell_134 v_ArrVal_970) |v_ULTIMATE.start_main_~l~0#1.base_51| v_ArrVal_980) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)))))) is different from false [2022-07-12 03:39:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 03:39:02,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300614803] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:02,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:02,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2022-07-12 03:39:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368051947] [2022-07-12 03:39:02,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:02,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 03:39:02,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:02,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 03:39:02,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=677, Unknown=4, NotChecked=106, Total=870 [2022-07-12 03:39:02,508 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand has 30 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 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:39:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:04,079 INFO L93 Difference]: Finished difference Result 221 states and 267 transitions. [2022-07-12 03:39:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 03:39:04,079 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 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 33 [2022-07-12 03:39:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:04,080 INFO L225 Difference]: With dead ends: 221 [2022-07-12 03:39:04,080 INFO L226 Difference]: Without dead ends: 219 [2022-07-12 03:39:04,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=407, Invalid=2145, Unknown=6, NotChecked=198, Total=2756 [2022-07-12 03:39:04,081 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 169 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:04,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 292 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 395 Invalid, 0 Unknown, 198 Unchecked, 0.2s Time] [2022-07-12 03:39:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-12 03:39:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 130. [2022-07-12 03:39:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.2890625) internal successors, (165), 129 states have internal predecessors, (165), 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:39:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2022-07-12 03:39:04,097 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 33 [2022-07-12 03:39:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:04,097 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2022-07-12 03:39:04,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 states have internal predecessors, (89), 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:39:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-07-12 03:39:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:39:04,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:04,098 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:04,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:04,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:04,302 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:04,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:04,302 INFO L85 PathProgramCache]: Analyzing trace with hash -200028325, now seen corresponding path program 2 times [2022-07-12 03:39:04,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:04,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493010754] [2022-07-12 03:39:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:04,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:04,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493010754] [2022-07-12 03:39:04,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493010754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:04,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334186914] [2022-07-12 03:39:04,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:39:04,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:04,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:04,554 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39:04,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 03:39:04,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:39:04,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:04,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 03:39:04,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:04,684 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:39:04,737 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:39:04,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,746 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 24 treesize of output 27 [2022-07-12 03:39:04,749 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:39:04,763 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:04,763 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 21 treesize of output 29 [2022-07-12 03:39:04,890 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:04,894 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:04,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2022-07-12 03:39:04,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,904 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 43 treesize of output 37 [2022-07-12 03:39:04,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,908 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 18 treesize of output 20 [2022-07-12 03:39:04,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,915 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:04,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:05,220 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:05,220 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 107 treesize of output 61 [2022-07-12 03:39:05,230 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:05,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:39:05,274 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 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-12 03:39:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:05,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:05,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:05,434 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 32 treesize of output 36 [2022-07-12 03:39:05,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:05,438 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 29 treesize of output 33 [2022-07-12 03:39:05,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_56| Int)) (or (<= |c_ULTIMATE.start_main_~min~0#1| (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_56| v_ArrVal_1070) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_56| v_arrayElimArr_21) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_56| v_arrayElimArr_22) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (not (= (select v_arrayElimArr_21 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_56|) 0)) (not (= (select v_arrayElimArr_22 0) |c_ULTIMATE.start_main_~l~0#1.offset|)))) is different from false [2022-07-12 03:39:05,490 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_56| Int)) (or (not (= (select v_arrayElimArr_21 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_56| v_ArrVal_1070) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_56| v_arrayElimArr_21) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_56| v_arrayElimArr_22) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_56|) 0)) (not (= (select v_arrayElimArr_22 0) |c_ULTIMATE.start_main_~l~0#1.offset|)))) is different from false [2022-07-12 03:39:05,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:05,505 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 73 treesize of output 72 [2022-07-12 03:39:05,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:05,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2022-07-12 03:39:05,512 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 56 [2022-07-12 03:39:05,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:05,517 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 40 treesize of output 41 [2022-07-12 03:39:05,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:05,520 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-07-12 03:39:05,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:05,661 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:05,661 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 38 [2022-07-12 03:39:05,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:05,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:05,666 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 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-12 03:39:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-12 03:39:05,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334186914] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:05,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:05,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2022-07-12 03:39:05,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777119887] [2022-07-12 03:39:05,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:05,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 03:39:05,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:05,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 03:39:05,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=850, Unknown=3, NotChecked=118, Total=1056 [2022-07-12 03:39:05,671 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 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:39:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:09,400 INFO L93 Difference]: Finished difference Result 344 states and 396 transitions. [2022-07-12 03:39:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-12 03:39:09,402 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 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 33 [2022-07-12 03:39:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:09,403 INFO L225 Difference]: With dead ends: 344 [2022-07-12 03:39:09,403 INFO L226 Difference]: Without dead ends: 342 [2022-07-12 03:39:09,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=828, Invalid=5333, Unknown=9, NotChecked=310, Total=6480 [2022-07-12 03:39:09,405 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 247 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 693 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:09,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 673 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 744 Invalid, 0 Unknown, 693 Unchecked, 0.5s Time] [2022-07-12 03:39:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-12 03:39:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 136. [2022-07-12 03:39:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.291044776119403) internal successors, (173), 135 states have internal predecessors, (173), 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:39:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 173 transitions. [2022-07-12 03:39:09,424 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 173 transitions. Word has length 33 [2022-07-12 03:39:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:09,424 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 173 transitions. [2022-07-12 03:39:09,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 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:39:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-07-12 03:39:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:39:09,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:09,425 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:09,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:09,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:09,639 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash -250156201, now seen corresponding path program 3 times [2022-07-12 03:39:09,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:09,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756991283] [2022-07-12 03:39:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:09,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756991283] [2022-07-12 03:39:09,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756991283] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:09,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200038807] [2022-07-12 03:39:09,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:39:09,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:09,905 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:09,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 03:39:10,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 03:39:10,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:10,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 03:39:10,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:10,019 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:39:10,059 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:39:10,067 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:39:10,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,070 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 18 treesize of output 20 [2022-07-12 03:39:10,096 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:10,096 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 21 treesize of output 29 [2022-07-12 03:39:10,157 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:10,162 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:10,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,166 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 43 treesize of output 37 [2022-07-12 03:39:10,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,171 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 22 treesize of output 24 [2022-07-12 03:39:10,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,179 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:10,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:10,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,183 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 18 treesize of output 20 [2022-07-12 03:39:10,467 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:10,467 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 77 treesize of output 47 [2022-07-12 03:39:10,472 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:10,472 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:39:10,503 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:10,503 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 26 treesize of output 14 [2022-07-12 03:39:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:10,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:10,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:10,641 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 34 treesize of output 38 [2022-07-12 03:39:10,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:10,645 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 31 treesize of output 35 [2022-07-12 03:39:10,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_62| Int) (v_arrayElimArr_28 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1166 4))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_29 0))) (<= |c_ULTIMATE.start_main_~min~0#1| .cse0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_62|) 0)) (<= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_62| v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_62| v_arrayElimArr_28) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_62| v_arrayElimArr_29) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2022-07-12 03:39:10,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:10,730 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 61 treesize of output 60 [2022-07-12 03:39:10,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:10,739 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 57 treesize of output 45 [2022-07-12 03:39:10,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 60 treesize of output 48 [2022-07-12 03:39:10,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:10,746 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 32 treesize of output 33 [2022-07-12 03:39:10,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:10,750 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 30 treesize of output 22 [2022-07-12 03:39:10,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:10,818 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 157 treesize of output 154 [2022-07-12 03:39:10,824 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 126 [2022-07-12 03:39:10,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:10,833 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 131 treesize of output 107 [2022-07-12 03:39:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 03:39:10,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200038807] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:10,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:10,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 31 [2022-07-12 03:39:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880658916] [2022-07-12 03:39:10,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:10,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 03:39:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 03:39:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=781, Unknown=3, NotChecked=56, Total=930 [2022-07-12 03:39:11,000 INFO L87 Difference]: Start difference. First operand 136 states and 173 transitions. Second operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 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:39:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:12,484 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2022-07-12 03:39:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 03:39:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 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 33 [2022-07-12 03:39:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:12,496 INFO L225 Difference]: With dead ends: 165 [2022-07-12 03:39:12,496 INFO L226 Difference]: Without dead ends: 163 [2022-07-12 03:39:12,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=421, Invalid=1834, Unknown=5, NotChecked=92, Total=2352 [2022-07-12 03:39:12,497 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 164 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:12,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 213 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 339 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2022-07-12 03:39:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-12 03:39:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 91. [2022-07-12 03:39:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 90 states have internal predecessors, (113), 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:39:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-07-12 03:39:12,509 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 33 [2022-07-12 03:39:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:12,509 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-07-12 03:39:12,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 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:39:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-07-12 03:39:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:39:12,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:12,510 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:12,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:12,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 03:39:12,711 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:12,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1108473179, now seen corresponding path program 3 times [2022-07-12 03:39:12,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:12,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63606747] [2022-07-12 03:39:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:13,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:13,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63606747] [2022-07-12 03:39:13,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63606747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:13,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957549515] [2022-07-12 03:39:13,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:39:13,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:13,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:13,101 INFO L229 MonitoredProcess]: Starting monitored process 18 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:39:13,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 03:39:13,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 03:39:13,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:13,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 03:39:13,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:13,236 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:39:13,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,239 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 16 treesize of output 17 [2022-07-12 03:39:13,285 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:39:13,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,292 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 18 treesize of output 20 [2022-07-12 03:39:13,304 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:13,304 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 21 treesize of output 29 [2022-07-12 03:39:13,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:39:13,389 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:13,393 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:13,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,398 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 16 treesize of output 18 [2022-07-12 03:39:13,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,404 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 43 treesize of output 37 [2022-07-12 03:39:13,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:13,412 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:13,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:13,415 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 22 treesize of output 24 [2022-07-12 03:39:13,854 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:13,854 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 85 treesize of output 47 [2022-07-12 03:39:13,861 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:13,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:39:13,916 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 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-12 03:39:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:13,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:14,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:14,154 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 34 treesize of output 38 [2022-07-12 03:39:14,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:14,159 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 31 treesize of output 35 [2022-07-12 03:39:14,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_35 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_67| Int) (v_ArrVal_1262 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1262 4))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_34 0))) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_67| v_ArrVal_1262) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_67| v_arrayElimArr_34) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_67| v_arrayElimArr_35) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4)) .cse0) (not (= (select v_arrayElimArr_35 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_67|) 0)) (< .cse0 |c_ULTIMATE.start_main_~min~0#1|)))) is different from false [2022-07-12 03:39:14,226 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:14,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 61 treesize of output 60 [2022-07-12 03:39:14,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:14,232 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 57 treesize of output 45 [2022-07-12 03:39:14,241 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 48 [2022-07-12 03:39:14,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:14,246 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 32 treesize of output 33 [2022-07-12 03:39:14,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:14,249 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 30 treesize of output 22 [2022-07-12 03:39:14,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:14,353 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-07-12 03:39:14,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:14,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:14,357 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 17 treesize of output 9 [2022-07-12 03:39:14,360 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:39:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-12 03:39:14,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957549515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:14,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:14,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 36 [2022-07-12 03:39:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551476487] [2022-07-12 03:39:14,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:14,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 03:39:14,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:14,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 03:39:14,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1088, Unknown=2, NotChecked=66, Total=1260 [2022-07-12 03:39:14,364 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 36 states have internal predecessors, (95), 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:39:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:18,323 INFO L93 Difference]: Finished difference Result 216 states and 249 transitions. [2022-07-12 03:39:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-12 03:39:18,324 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 36 states have internal predecessors, (95), 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 35 [2022-07-12 03:39:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:18,326 INFO L225 Difference]: With dead ends: 216 [2022-07-12 03:39:18,327 INFO L226 Difference]: Without dead ends: 214 [2022-07-12 03:39:18,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=826, Invalid=5027, Unknown=3, NotChecked=150, Total=6006 [2022-07-12 03:39:18,328 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 166 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:18,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 393 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 973 Invalid, 0 Unknown, 410 Unchecked, 0.6s Time] [2022-07-12 03:39:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-12 03:39:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 130. [2022-07-12 03:39:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.2578125) internal successors, (161), 129 states have internal predecessors, (161), 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:39:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2022-07-12 03:39:18,346 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 35 [2022-07-12 03:39:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:18,346 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2022-07-12 03:39:18,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 36 states have internal predecessors, (95), 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:39:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-07-12 03:39:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:39:18,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:18,347 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:18,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:18,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:18,548 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1046433565, now seen corresponding path program 3 times [2022-07-12 03:39:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:18,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321514173] [2022-07-12 03:39:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:18,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321514173] [2022-07-12 03:39:18,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321514173] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:18,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308576261] [2022-07-12 03:39:18,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:39:18,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:18,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:18,733 INFO L229 MonitoredProcess]: Starting monitored process 19 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:39:18,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 03:39:18,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 03:39:18,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:18,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 03:39:18,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:18,865 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:39:18,891 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:39:18,896 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:39:18,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:18,900 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 18 treesize of output 20 [2022-07-12 03:39:18,912 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:18,913 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 21 treesize of output 29 [2022-07-12 03:39:18,976 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:18,979 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:18,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:18,991 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 43 treesize of output 37 [2022-07-12 03:39:18,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:18,995 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 22 treesize of output 24 [2022-07-12 03:39:19,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:19,004 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:19,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:19,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:19,008 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 18 treesize of output 20 [2022-07-12 03:39:19,224 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:19,224 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 85 treesize of output 47 [2022-07-12 03:39:19,229 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:19,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:39:19,269 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:39:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:19,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:19,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:19,344 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 32 treesize of output 36 [2022-07-12 03:39:19,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:19,348 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 29 treesize of output 33 [2022-07-12 03:39:19,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_73| Int) (v_ArrVal_1350 (Array Int Int)) (v_arrayElimArr_42 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (or (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_73| v_ArrVal_1350) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_73| v_arrayElimArr_41) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_73| v_arrayElimArr_42) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4)) |c_ULTIMATE.start_main_~max~0#1|) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_42 0))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_41 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_73|) 0)))) is different from false [2022-07-12 03:39:19,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:19,403 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 62 [2022-07-12 03:39:19,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:19,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2022-07-12 03:39:19,409 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 48 [2022-07-12 03:39:19,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:19,413 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 32 treesize of output 33 [2022-07-12 03:39:19,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:19,416 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-07-12 03:39:19,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:19,454 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 133 [2022-07-12 03:39:19,457 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 110 [2022-07-12 03:39:19,464 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 110 treesize of output 94 [2022-07-12 03:39:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 03:39:19,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308576261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:19,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:19,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 24 [2022-07-12 03:39:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434825092] [2022-07-12 03:39:19,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:19,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 03:39:19,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:19,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 03:39:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=446, Unknown=1, NotChecked=42, Total=552 [2022-07-12 03:39:19,590 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 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:39:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:20,304 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2022-07-12 03:39:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 03:39:20,311 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 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 35 [2022-07-12 03:39:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:20,312 INFO L225 Difference]: With dead ends: 219 [2022-07-12 03:39:20,312 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 03:39:20,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=1132, Unknown=2, NotChecked=70, Total=1406 [2022-07-12 03:39:20,313 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 115 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:20,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 207 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 348 Invalid, 0 Unknown, 188 Unchecked, 0.2s Time] [2022-07-12 03:39:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 03:39:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 149. [2022-07-12 03:39:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 148 states have internal predecessors, (188), 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:39:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 188 transitions. [2022-07-12 03:39:20,338 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 188 transitions. Word has length 35 [2022-07-12 03:39:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:20,338 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 188 transitions. [2022-07-12 03:39:20,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 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:39:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 188 transitions. [2022-07-12 03:39:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:39:20,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:20,339 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:20,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:20,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:20,552 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2065136743, now seen corresponding path program 2 times [2022-07-12 03:39:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:20,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076409925] [2022-07-12 03:39:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:20,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076409925] [2022-07-12 03:39:20,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076409925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955267998] [2022-07-12 03:39:20,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:39:20,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:20,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:20,804 INFO L229 MonitoredProcess]: Starting monitored process 20 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:39:20,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 03:39:20,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:39:20,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:20,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 03:39:20,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:20,986 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:39:21,057 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:39:21,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:21,062 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 18 treesize of output 20 [2022-07-12 03:39:21,076 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:21,076 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 21 treesize of output 29 [2022-07-12 03:39:21,089 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:39:21,275 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:21,279 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:21,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:21,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:39:21,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:21,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:21,300 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 03:39:21,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-12 03:39:21,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:21,305 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 37 treesize of output 35 [2022-07-12 03:39:21,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:21,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:21,317 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:21,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:21,686 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-12 03:39:21,688 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 80 treesize of output 50 [2022-07-12 03:39:21,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:21,695 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:21,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:39:21,753 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 03:39:21,753 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 37 treesize of output 25 [2022-07-12 03:39:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:21,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:21,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:21,961 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 34 treesize of output 38 [2022-07-12 03:39:21,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:21,966 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 31 treesize of output 35 [2022-07-12 03:39:21,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1447 (Array Int Int)) (v_arrayElimArr_48 (Array Int Int)) (v_arrayElimArr_47 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_78| Int)) (let ((.cse0 (select v_ArrVal_1447 4))) (or (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_78| v_ArrVal_1447) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_78| v_arrayElimArr_47) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_78| v_arrayElimArr_48) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4)) .cse0) (not (= (select v_arrayElimArr_48 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_78|) 0)) (not (= (select v_arrayElimArr_47 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2022-07-12 03:39:22,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:22,146 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 65 treesize of output 64 [2022-07-12 03:39:22,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:22,151 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2022-07-12 03:39:22,154 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 62 treesize of output 50 [2022-07-12 03:39:22,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:22,159 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:39:22,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:22,163 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2022-07-12 03:39:22,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:22,234 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 157 treesize of output 154 [2022-07-12 03:39:22,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:22,242 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 78 [2022-07-12 03:39:22,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:22,252 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 131 treesize of output 107 [2022-07-12 03:39:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 23 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 03:39:22,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955267998] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:22,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:22,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2022-07-12 03:39:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100983338] [2022-07-12 03:39:22,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 03:39:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:22,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 03:39:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1326, Unknown=5, NotChecked=74, Total=1560 [2022-07-12 03:39:22,630 INFO L87 Difference]: Start difference. First operand 149 states and 188 transitions. Second operand has 40 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 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:39:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:26,521 INFO L93 Difference]: Finished difference Result 341 states and 391 transitions. [2022-07-12 03:39:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-12 03:39:26,521 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 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 35 [2022-07-12 03:39:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:26,523 INFO L225 Difference]: With dead ends: 341 [2022-07-12 03:39:26,523 INFO L226 Difference]: Without dead ends: 339 [2022-07-12 03:39:26,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 48 SyntacticMatches, 18 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1182, Invalid=6127, Unknown=5, NotChecked=168, Total=7482 [2022-07-12 03:39:26,524 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 392 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:26,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 547 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 928 Invalid, 0 Unknown, 474 Unchecked, 0.6s Time] [2022-07-12 03:39:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-12 03:39:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 164. [2022-07-12 03:39:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 163 states have internal predecessors, (209), 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:39:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2022-07-12 03:39:26,566 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 35 [2022-07-12 03:39:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:26,566 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2022-07-12 03:39:26,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.4) internal successors, (96), 40 states have internal predecessors, (96), 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:39:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2022-07-12 03:39:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:39:26,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:26,567 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:26,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-12 03:39:26,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:26,768 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash -678933349, now seen corresponding path program 4 times [2022-07-12 03:39:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:26,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793736663] [2022-07-12 03:39:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:27,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793736663] [2022-07-12 03:39:27,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793736663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988210995] [2022-07-12 03:39:27,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:39:27,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:27,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:27,160 INFO L229 MonitoredProcess]: Starting monitored process 21 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:39:27,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 03:39:27,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:39:27,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:27,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 03:39:27,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:27,286 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:39:27,313 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:39:27,321 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:39:27,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,325 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 18 treesize of output 20 [2022-07-12 03:39:27,340 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:27,341 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 21 treesize of output 29 [2022-07-12 03:39:27,481 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:27,486 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:27,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,492 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 37 treesize of output 35 [2022-07-12 03:39:27,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,501 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 03:39:27,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-12 03:39:27,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,512 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:27,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:27,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,523 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 18 treesize of output 20 [2022-07-12 03:39:27,883 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-12 03:39:27,884 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 80 treesize of output 50 [2022-07-12 03:39:27,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:27,890 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:27,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:39:27,951 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 03:39:27,951 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 37 treesize of output 25 [2022-07-12 03:39:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:27,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:28,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:28,165 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 34 treesize of output 38 [2022-07-12 03:39:28,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:28,170 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 31 treesize of output 35 [2022-07-12 03:39:28,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_54 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_83| Int) (v_ArrVal_1534 (Array Int Int)) (v_arrayElimArr_53 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1534 4))) (or (not (= (select v_arrayElimArr_53 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_83| v_ArrVal_1534) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_83| v_arrayElimArr_53) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_83| v_arrayElimArr_54) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4)) .cse0) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_54 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_83|) 0)) (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|)))) is different from false [2022-07-12 03:39:28,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:28,349 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 69 treesize of output 68 [2022-07-12 03:39:28,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:28,354 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 65 treesize of output 49 [2022-07-12 03:39:28,369 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 64 treesize of output 52 [2022-07-12 03:39:28,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:28,375 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 36 treesize of output 37 [2022-07-12 03:39:28,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:28,380 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 34 treesize of output 22 [2022-07-12 03:39:28,384 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 27 treesize of output 21 [2022-07-12 03:39:28,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_83| Int) (v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1531 (Array Int Int)) (v_arrayElimCell_278 Int)) (let ((.cse0 (select v_ArrVal_1531 4)) (.cse1 (select v_ArrVal_1534 4))) (or (<= .cse0 |c_ULTIMATE.start_main_#t~mem8#1|) (<= .cse1 .cse0) (not (= (select (store |c_#valid| v_arrayElimCell_278 1) |v_ULTIMATE.start_main_~l~0#1.base_83|) 0)) (not (= (select |c_#valid| v_arrayElimCell_278) 0)) (<= (select (select (store (store |c_#memory_int| v_arrayElimCell_278 v_ArrVal_1531) |v_ULTIMATE.start_main_~l~0#1.base_83| v_ArrVal_1534) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse1)))) is different from false [2022-07-12 03:39:28,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:28,492 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 79 treesize of output 82 [2022-07-12 03:39:28,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:28,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 69 treesize of output 61 [2022-07-12 03:39:28,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:28,510 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 35 treesize of output 37 [2022-07-12 03:39:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 03:39:28,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988210995] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:28,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:28,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 40 [2022-07-12 03:39:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153866069] [2022-07-12 03:39:28,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:28,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 03:39:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:28,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 03:39:28,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1264, Unknown=6, NotChecked=146, Total=1560 [2022-07-12 03:39:28,784 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand has 40 states, 40 states have (on average 2.325) internal successors, (93), 40 states have internal predecessors, (93), 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:39:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:30,724 INFO L93 Difference]: Finished difference Result 358 states and 424 transitions. [2022-07-12 03:39:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 03:39:30,725 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.325) internal successors, (93), 40 states have internal predecessors, (93), 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 35 [2022-07-12 03:39:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:30,729 INFO L225 Difference]: With dead ends: 358 [2022-07-12 03:39:30,729 INFO L226 Difference]: Without dead ends: 356 [2022-07-12 03:39:30,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=537, Invalid=4016, Unknown=11, NotChecked=266, Total=4830 [2022-07-12 03:39:30,730 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:30,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 422 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 684 Invalid, 0 Unknown, 300 Unchecked, 0.3s Time] [2022-07-12 03:39:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-12 03:39:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 189. [2022-07-12 03:39:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 1.3155080213903743) internal successors, (246), 188 states have internal predecessors, (246), 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:39:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 246 transitions. [2022-07-12 03:39:30,785 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 246 transitions. Word has length 35 [2022-07-12 03:39:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:30,786 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 246 transitions. [2022-07-12 03:39:30,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.325) internal successors, (93), 40 states have internal predecessors, (93), 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:39:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2022-07-12 03:39:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:39:30,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:30,787 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:30,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:31,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 03:39:31,006 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:31,006 INFO L85 PathProgramCache]: Analyzing trace with hash -812946855, now seen corresponding path program 5 times [2022-07-12 03:39:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:31,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938217902] [2022-07-12 03:39:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:31,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938217902] [2022-07-12 03:39:31,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938217902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:31,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495781122] [2022-07-12 03:39:31,206 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 03:39:31,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:31,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:31,207 INFO L229 MonitoredProcess]: Starting monitored process 22 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:39:31,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 03:39:31,351 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-12 03:39:31,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:31,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 03:39:31,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:31,373 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:39:31,451 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:39:31,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:31,455 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 18 treesize of output 20 [2022-07-12 03:39:31,467 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:31,467 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 21 treesize of output 29 [2022-07-12 03:39:31,476 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:39:31,547 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:31,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:31,553 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 43 treesize of output 37 [2022-07-12 03:39:31,557 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:31,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:31,562 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 22 treesize of output 24 [2022-07-12 03:39:31,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:31,571 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:31,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:31,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:31,576 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 18 treesize of output 20 [2022-07-12 03:39:31,920 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:39:31,920 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 77 treesize of output 47 [2022-07-12 03:39:31,926 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:31,926 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:39:31,969 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:31,969 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 26 treesize of output 14 [2022-07-12 03:39:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:31,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:32,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:32,162 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 34 treesize of output 38 [2022-07-12 03:39:32,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:32,166 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 31 treesize of output 35 [2022-07-12 03:39:32,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_59 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (v_arrayElimArr_60 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_88| Int)) (let ((.cse0 (select v_ArrVal_1632 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_88|) 0)) (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_88| v_ArrVal_1632) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_88| v_arrayElimArr_59) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_88| v_arrayElimArr_60) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4)) .cse0) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_60 0))) (not (= (select v_arrayElimArr_59 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2022-07-12 03:39:32,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:32,224 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 61 treesize of output 60 [2022-07-12 03:39:32,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:32,227 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 57 treesize of output 45 [2022-07-12 03:39:32,232 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 48 [2022-07-12 03:39:32,238 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:32,238 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 32 treesize of output 33 [2022-07-12 03:39:32,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:32,243 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 30 treesize of output 22 [2022-07-12 03:39:32,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_88| Int) (v_arrayElimCell_305 Int)) (let ((.cse0 (select v_ArrVal_1632 4))) (or (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (<= (select (select (store (store |c_#memory_int| v_arrayElimCell_305 v_ArrVal_1621) |v_ULTIMATE.start_main_~l~0#1.base_88| v_ArrVal_1632) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0) (not (= (select |c_#valid| v_arrayElimCell_305) 0)) (not (= (select (store |c_#valid| v_arrayElimCell_305 1) |v_ULTIMATE.start_main_~l~0#1.base_88|) 0))))) is different from false [2022-07-12 03:39:32,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1632 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_88| Int) (v_arrayElimCell_305 Int)) (let ((.cse0 (select v_ArrVal_1632 4))) (or (<= .cse0 |c_ULTIMATE.start_main_#t~mem8#1|) (<= (select (select (store (store |c_#memory_int| v_arrayElimCell_305 v_ArrVal_1621) |v_ULTIMATE.start_main_~l~0#1.base_88| v_ArrVal_1632) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0) (not (= (select |c_#valid| v_arrayElimCell_305) 0)) (not (= (select (store |c_#valid| v_arrayElimCell_305 1) |v_ULTIMATE.start_main_~l~0#1.base_88|) 0))))) is different from false [2022-07-12 03:39:32,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:32,298 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 157 treesize of output 154 [2022-07-12 03:39:32,304 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 67 treesize of output 59 [2022-07-12 03:39:32,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:32,315 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 131 treesize of output 107 [2022-07-12 03:39:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-12 03:39:32,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495781122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:32,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:32,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 13] total 38 [2022-07-12 03:39:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665664403] [2022-07-12 03:39:32,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:32,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 03:39:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:32,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 03:39:32,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1077, Unknown=3, NotChecked=204, Total=1406 [2022-07-12 03:39:32,551 INFO L87 Difference]: Start difference. First operand 189 states and 246 transitions. Second operand has 38 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 38 states have internal predecessors, (98), 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:39:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:35,332 INFO L93 Difference]: Finished difference Result 327 states and 398 transitions. [2022-07-12 03:39:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 03:39:35,334 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 38 states have internal predecessors, (98), 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 35 [2022-07-12 03:39:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:35,335 INFO L225 Difference]: With dead ends: 327 [2022-07-12 03:39:35,336 INFO L226 Difference]: Without dead ends: 325 [2022-07-12 03:39:35,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=827, Invalid=3604, Unknown=3, NotChecked=396, Total=4830 [2022-07-12 03:39:35,337 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 176 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:35,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 255 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 570 Invalid, 0 Unknown, 262 Unchecked, 0.4s Time] [2022-07-12 03:39:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-12 03:39:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 115. [2022-07-12 03:39:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 113 states have (on average 1.238938053097345) internal successors, (140), 114 states have internal predecessors, (140), 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:39:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2022-07-12 03:39:35,371 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 35 [2022-07-12 03:39:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:35,371 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2022-07-12 03:39:35,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 38 states have internal predecessors, (98), 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:39:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2022-07-12 03:39:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:39:35,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:35,372 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:35,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:35,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 03:39:35,598 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash -740972963, now seen corresponding path program 6 times [2022-07-12 03:39:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:35,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224156317] [2022-07-12 03:39:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:39:35,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:35,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224156317] [2022-07-12 03:39:35,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224156317] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:35,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482831973] [2022-07-12 03:39:35,701 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 03:39:35,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:35,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:35,716 INFO L229 MonitoredProcess]: Starting monitored process 23 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:39:35,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-12 03:39:35,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-12 03:39:35,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:35,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 03:39:35,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:35,888 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 19 treesize of output 7 [2022-07-12 03:39:35,915 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 21 treesize of output 9 [2022-07-12 03:39:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:39:35,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:35,956 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 19 treesize of output 7 [2022-07-12 03:39:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 03:39:35,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482831973] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:35,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:35,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-07-12 03:39:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673550797] [2022-07-12 03:39:35,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:35,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 03:39:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:35,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 03:39:35,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:39:35,986 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 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:39:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:36,170 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2022-07-12 03:39:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:39:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 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) Word has length 35 [2022-07-12 03:39:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:36,172 INFO L225 Difference]: With dead ends: 206 [2022-07-12 03:39:36,172 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 03:39:36,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-07-12 03:39:36,173 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:36,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 113 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:39:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 03:39:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 70. [2022-07-12 03:39:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 69 states have internal predecessors, (82), 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:39:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-07-12 03:39:36,187 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 35 [2022-07-12 03:39:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:36,187 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-07-12 03:39:36,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 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:39:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-07-12 03:39:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:39:36,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:36,188 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:36,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:36,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 03:39:36,406 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1475182485, now seen corresponding path program 4 times [2022-07-12 03:39:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:36,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299830087] [2022-07-12 03:39:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:36,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299830087] [2022-07-12 03:39:36,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299830087] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:36,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110638556] [2022-07-12 03:39:36,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:39:36,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:36,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:36,558 INFO L229 MonitoredProcess]: Starting monitored process 24 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:39:36,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-12 03:39:36,689 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:39:36,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:36,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 03:39:36,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:39:36,712 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:39:36,715 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:39:36,752 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:36,755 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:36,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:36,758 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 16 treesize of output 18 [2022-07-12 03:39:36,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:36,761 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 18 treesize of output 20 [2022-07-12 03:39:36,771 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:36,771 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 21 treesize of output 29 [2022-07-12 03:39:36,840 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:36,843 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:36,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:36,852 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-12 03:39:36,852 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 56 treesize of output 52 [2022-07-12 03:39:36,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:36,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:36,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-07-12 03:39:36,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:36,863 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-12 03:39:36,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:39:37,182 INFO L356 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-07-12 03:39:37,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2022-07-12 03:39:37,199 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-12 03:39:37,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-12 03:39:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:37,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:37,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,261 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 33 treesize of output 37 [2022-07-12 03:39:37,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,265 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 30 treesize of output 31 [2022-07-12 03:39:37,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,273 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 33 treesize of output 34 [2022-07-12 03:39:37,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,276 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 27 treesize of output 31 [2022-07-12 03:39:37,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2022-07-12 03:39:37,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,414 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 36 treesize of output 40 [2022-07-12 03:39:37,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,429 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 42 treesize of output 43 [2022-07-12 03:39:37,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,433 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 36 treesize of output 40 [2022-07-12 03:39:37,477 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_69 (Array Int Int)) (v_arrayElimArr_70 (Array Int Int)) (v_arrayElimArr_73 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_96| Int) (v_arrayElimArr_74 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_69 0))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_74 0))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_73) |v_ULTIMATE.start_main_~l~0#1.base_96| v_arrayElimArr_69))) (select .cse0 (select (select .cse0 .cse1) 0))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_arrayElimArr_74) |v_ULTIMATE.start_main_~l~0#1.base_96| v_arrayElimArr_70) .cse1) 0)) 0) (not (= (select (store |c_#valid| .cse1 1) |v_ULTIMATE.start_main_~l~0#1.base_96|) 0)) (not (= (select v_arrayElimArr_73 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_70 0) 0)) (not (= (select |c_#valid| .cse1) 0))))) (forall ((v_arrayElimArr_68 (Array Int Int)) (v_arrayElimArr_67 (Array Int Int)) (v_arrayElimArr_71 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_96| Int) (v_arrayElimArr_72 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_67 0))) (or (= (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_71) |v_ULTIMATE.start_main_~l~0#1.base_96| v_arrayElimArr_68))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_72) |v_ULTIMATE.start_main_~l~0#1.base_96| v_arrayElimArr_67) .cse3) 0)) (select (select .cse2 .cse3) 0))) 0) (not (= (select v_arrayElimArr_72 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_71 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse3) 0)) (not (= (select v_arrayElimArr_68 0) 0)) (not (= (select (store |c_#valid| .cse3 1) |v_ULTIMATE.start_main_~l~0#1.base_96|) 0)))))) is different from false [2022-07-12 03:39:37,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,609 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 78 [2022-07-12 03:39:37,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,615 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 67 treesize of output 54 [2022-07-12 03:39:37,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:37,619 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 42 treesize of output 36 [2022-07-12 03:39:37,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:37,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2022-07-12 03:39:37,631 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 99 treesize of output 83 [2022-07-12 03:39:37,633 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 83 treesize of output 63 [2022-07-12 03:39:37,645 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:39:37,646 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 18 [2022-07-12 03:39:37,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,652 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 66 [2022-07-12 03:39:37,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:37,660 INFO L356 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-07-12 03:39:37,660 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 572 treesize of output 506 [2022-07-12 03:39:37,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:37,666 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 498 treesize of output 340 [2022-07-12 03:39:37,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:37,670 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 172 treesize of output 166 [2022-07-12 03:39:37,673 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 191 treesize of output 159 [2022-07-12 03:39:37,676 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 159 treesize of output 139 [2022-07-12 03:39:37,678 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 124 treesize of output 106 [2022-07-12 03:39:37,685 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:37,685 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 03:39:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-12 03:39:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110638556] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:37,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:37,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 21 [2022-07-12 03:39:37,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125323362] [2022-07-12 03:39:37,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:37,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 03:39:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:37,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 03:39:37,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2022-07-12 03:39:37,691 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:38,041 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-07-12 03:39:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:39:38,041 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 03:39:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:38,047 INFO L225 Difference]: With dead ends: 113 [2022-07-12 03:39:38,047 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 03:39:38,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=520, Unknown=1, NotChecked=46, Total=650 [2022-07-12 03:39:38,051 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:38,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 313 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2022-07-12 03:39:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 03:39:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-12 03:39:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 86 states have internal predecessors, (103), 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:39:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-07-12 03:39:38,069 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 38 [2022-07-12 03:39:38,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:38,069 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-07-12 03:39:38,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-07-12 03:39:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:39:38,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:38,070 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:38,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:38,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:38,283 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash -901782222, now seen corresponding path program 5 times [2022-07-12 03:39:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:38,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528124982] [2022-07-12 03:39:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:39,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:39,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528124982] [2022-07-12 03:39:39,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528124982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:39,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481272377] [2022-07-12 03:39:39,130 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 03:39:39,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:39,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:39,131 INFO L229 MonitoredProcess]: Starting monitored process 25 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:39:39,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-12 03:39:39,345 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-12 03:39:39,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:39,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-12 03:39:39,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:39,354 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:39:39,430 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:39:39,434 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:39:39,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,437 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 18 treesize of output 20 [2022-07-12 03:39:39,449 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:39,449 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 21 treesize of output 29 [2022-07-12 03:39:39,533 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:39,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,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 43 treesize of output 37 [2022-07-12 03:39:39,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,542 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 22 treesize of output 24 [2022-07-12 03:39:39,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,555 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-12 03:39:39,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-07-12 03:39:39,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,559 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 23 [2022-07-12 03:39:39,562 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 8 treesize of output 7 [2022-07-12 03:39:39,682 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:39,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,693 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-12 03:39:39,693 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 99 treesize of output 71 [2022-07-12 03:39:39,706 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:39,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,711 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 26 treesize of output 28 [2022-07-12 03:39:39,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-07-12 03:39:39,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:39,725 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-12 03:39:39,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-07-12 03:39:40,273 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-12 03:39:40,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 168 treesize of output 90 [2022-07-12 03:39:40,285 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-12 03:39:40,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-12 03:39:40,312 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:39:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:40,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:40,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:40,543 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 72 treesize of output 70 [2022-07-12 03:39:40,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:40,547 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 63 treesize of output 61 [2022-07-12 03:39:40,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_103| Int) (v_arrayElimArr_82 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_arrayElimArr_83 (Array Int Int))) (or (not (= (select v_arrayElimArr_83 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_103|) 0)) (not (= (select v_arrayElimArr_82 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (<= |c_ULTIMATE.start_main_~min~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_103| v_arrayElimArr_83)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_103| v_arrayElimArr_82))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_103| v_ArrVal_1927) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) is different from false [2022-07-12 03:39:40,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:40,598 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 115 treesize of output 113 [2022-07-12 03:39:40,602 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:40,602 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 106 treesize of output 104 [2022-07-12 03:39:40,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_103| Int) (v_ArrVal_1919 (Array Int Int)) (v_arrayElimArr_82 (Array Int Int)) (v_arrayElimArr_84 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_arrayElimArr_83 (Array Int Int)) (v_arrayElimArr_85 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_82 0))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_85 0))) (<= |c_ULTIMATE.start_main_~min~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_84) |v_ULTIMATE.start_main_~l~0#1.base_103| v_arrayElimArr_83)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_85) |v_ULTIMATE.start_main_~l~0#1.base_103| v_arrayElimArr_82))) (let ((.cse2 (select (select .cse1 .cse0) 0)) (.cse3 (select (select .cse4 .cse0) 0))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1919) |v_ULTIMATE.start_main_~l~0#1.base_103| v_ArrVal_1927) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_103|) 0)) (not (= (select v_arrayElimArr_84 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select v_arrayElimArr_83 0) 0))))) is different from false [2022-07-12 03:39:40,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:40,711 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 186 treesize of output 157 [2022-07-12 03:39:40,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:40,725 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 144 treesize of output 115 [2022-07-12 03:39:40,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:40,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:40,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:40,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:40,743 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 55 [2022-07-12 03:39:40,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:40,757 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 342 treesize of output 318 [2022-07-12 03:39:40,762 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 351 treesize of output 293 [2022-07-12 03:39:40,766 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 287 treesize of output 235 [2022-07-12 03:39:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-12 03:39:43,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481272377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:43,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:43,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 42 [2022-07-12 03:39:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052841464] [2022-07-12 03:39:43,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:43,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 03:39:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:43,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 03:39:43,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1457, Unknown=5, NotChecked=154, Total=1722 [2022-07-12 03:39:43,390 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 42 states, 42 states have (on average 2.857142857142857) internal successors, (120), 42 states have internal predecessors, (120), 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:39:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:53,577 INFO L93 Difference]: Finished difference Result 356 states and 398 transitions. [2022-07-12 03:39:53,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-07-12 03:39:53,577 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.857142857142857) internal successors, (120), 42 states have internal predecessors, (120), 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 43 [2022-07-12 03:39:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:53,578 INFO L225 Difference]: With dead ends: 356 [2022-07-12 03:39:53,578 INFO L226 Difference]: Without dead ends: 354 [2022-07-12 03:39:53,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 118 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1870, Invalid=11919, Unknown=25, NotChecked=466, Total=14280 [2022-07-12 03:39:53,579 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 431 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 966 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:53,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 639 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1458 Invalid, 0 Unknown, 966 Unchecked, 1.1s Time] [2022-07-12 03:39:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-07-12 03:39:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 163. [2022-07-12 03:39:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 162 states have internal predecessors, (201), 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:39:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2022-07-12 03:39:53,632 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 43 [2022-07-12 03:39:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:53,633 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2022-07-12 03:39:53,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.857142857142857) internal successors, (120), 42 states have internal predecessors, (120), 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:39:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2022-07-12 03:39:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:39:53,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:53,633 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:53,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:53,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:53,834 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2140995186, now seen corresponding path program 4 times [2022-07-12 03:39:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:53,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238922535] [2022-07-12 03:39:53,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:53,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:54,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:54,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238922535] [2022-07-12 03:39:54,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238922535] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:54,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053602251] [2022-07-12 03:39:54,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:39:54,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:54,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:54,134 INFO L229 MonitoredProcess]: Starting monitored process 26 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:39:54,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-12 03:39:54,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:39:54,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:54,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-12 03:39:54,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:54,284 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:39:54,341 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:39:54,345 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:39:54,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,348 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 18 treesize of output 20 [2022-07-12 03:39:54,359 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:39:54,359 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 21 treesize of output 29 [2022-07-12 03:39:54,439 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:54,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,444 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 43 treesize of output 37 [2022-07-12 03:39:54,448 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:54,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,453 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 22 treesize of output 24 [2022-07-12 03:39:54,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,468 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-12 03:39:54,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-07-12 03:39:54,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,473 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 18 treesize of output 20 [2022-07-12 03:39:54,647 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:54,652 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:39:54,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,659 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 03:39:54,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2022-07-12 03:39:54,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-07-12 03:39:54,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,679 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-12 03:39:54,679 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 89 treesize of output 69 [2022-07-12 03:39:54,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:54,689 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-12 03:39:54,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-07-12 03:39:55,233 INFO L356 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2022-07-12 03:39:55,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 155 treesize of output 93 [2022-07-12 03:39:55,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:55,244 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-12 03:39:55,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-12 03:39:55,293 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 03:39:55,293 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 37 treesize of output 25 [2022-07-12 03:39:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:55,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:55,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:55,512 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 74 treesize of output 72 [2022-07-12 03:39:55,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:55,516 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 65 treesize of output 63 [2022-07-12 03:39:55,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_93 (Array Int Int)) (v_ArrVal_2056 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_110| Int) (v_arrayElimArr_92 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2056 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_110|) 0)) (<= |c_ULTIMATE.start_main_~min~0#1| .cse0) (<= .cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_110| v_arrayElimArr_93)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_110| v_arrayElimArr_92))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_110| v_ArrVal_2056) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_92 0))) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_93 0)))))) is different from false [2022-07-12 03:39:55,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:55,650 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 117 treesize of output 115 [2022-07-12 03:39:55,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:55,655 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 108 treesize of output 106 [2022-07-12 03:39:55,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:55,846 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 176 treesize of output 151 [2022-07-12 03:39:55,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:55,852 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 140 treesize of output 115 [2022-07-12 03:39:55,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:55,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:55,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:55,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:55,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 57 [2022-07-12 03:39:55,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:55,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 158 [2022-07-12 03:39:55,879 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 191 treesize of output 161 [2022-07-12 03:39:55,882 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 155 treesize of output 131 [2022-07-12 03:39:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-12 03:39:59,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053602251] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:59,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:59,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 41 [2022-07-12 03:39:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105561369] [2022-07-12 03:39:59,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:59,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 03:39:59,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 03:39:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1430, Unknown=8, NotChecked=76, Total=1640 [2022-07-12 03:39:59,364 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 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:40:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:07,930 INFO L93 Difference]: Finished difference Result 379 states and 431 transitions. [2022-07-12 03:40:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-12 03:40:07,931 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 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 43 [2022-07-12 03:40:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:07,932 INFO L225 Difference]: With dead ends: 379 [2022-07-12 03:40:07,932 INFO L226 Difference]: Without dead ends: 377 [2022-07-12 03:40:07,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 66 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2855 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1733, Invalid=7763, Unknown=14, NotChecked=192, Total=9702 [2022-07-12 03:40:07,933 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 342 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 573 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:07,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 714 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1013 Invalid, 0 Unknown, 573 Unchecked, 0.7s Time] [2022-07-12 03:40:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-12 03:40:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 182. [2022-07-12 03:40:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.2666666666666666) internal successors, (228), 181 states have internal predecessors, (228), 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:40:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 228 transitions. [2022-07-12 03:40:08,007 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 228 transitions. Word has length 43 [2022-07-12 03:40:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:08,007 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 228 transitions. [2022-07-12 03:40:08,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 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:40:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 228 transitions. [2022-07-12 03:40:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:40:08,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:08,009 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:40:08,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-12 03:40:08,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-12 03:40:08,223 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:08,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1476214582, now seen corresponding path program 5 times [2022-07-12 03:40:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:08,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916692653] [2022-07-12 03:40:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:08,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:08,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916692653] [2022-07-12 03:40:08,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916692653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:08,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857274890] [2022-07-12 03:40:08,673 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 03:40:08,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:08,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:08,675 INFO L229 MonitoredProcess]: Starting monitored process 27 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:40:08,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-12 03:40:08,981 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-12 03:40:08,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:40:08,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-12 03:40:08,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:09,009 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:40:09,092 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:40:09,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,099 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 24 treesize of output 27 [2022-07-12 03:40:09,102 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:40:09,115 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:40:09,116 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 21 treesize of output 29 [2022-07-12 03:40:09,260 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:40:09,265 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:40:09,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2022-07-12 03:40:09,296 INFO L356 Elim1Store]: treesize reduction 60, result has 36.8 percent of original size [2022-07-12 03:40:09,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 49 [2022-07-12 03:40:09,300 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 53 treesize of output 43 [2022-07-12 03:40:09,304 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 18 treesize of output 20 [2022-07-12 03:40:09,458 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:40:09,463 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:40:09,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,476 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-12 03:40:09,476 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 125 treesize of output 89 [2022-07-12 03:40:09,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2022-07-12 03:40:09,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,495 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-12 03:40:09,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-07-12 03:40:09,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:09,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-07-12 03:40:10,203 INFO L356 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2022-07-12 03:40:10,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 186 treesize of output 100 [2022-07-12 03:40:10,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:10,218 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-12 03:40:10,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-12 03:40:10,291 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:40:10,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 24 [2022-07-12 03:40:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:10,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:10,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:10,494 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 74 treesize of output 72 [2022-07-12 03:40:10,497 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:10,497 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 65 treesize of output 63 [2022-07-12 03:40:10,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2181 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_117| Int) (v_arrayElimArr_103 (Array Int Int)) (v_arrayElimArr_102 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2181 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_117|) 0)) (not (= (select v_arrayElimArr_103 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (<= |c_ULTIMATE.start_main_~min~0#1| .cse0) (<= .cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_117| v_arrayElimArr_103)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_117| v_arrayElimArr_102))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_117| v_ArrVal_2181) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) (not (= (select v_arrayElimArr_102 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2022-07-12 03:40:10,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:10,555 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 117 treesize of output 115 [2022-07-12 03:40:10,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:10,567 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 108 treesize of output 106 [2022-07-12 03:40:10,811 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:10,812 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 186 treesize of output 161 [2022-07-12 03:40:10,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:10,818 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 150 treesize of output 125 [2022-07-12 03:40:10,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:10,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:10,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:10,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:10,825 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 67 [2022-07-12 03:40:10,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:10,830 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 198 [2022-07-12 03:40:10,834 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 231 treesize of output 193 [2022-07-12 03:40:10,836 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 187 treesize of output 163 [2022-07-12 03:40:17,819 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 93 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:40:20,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:20,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:20,200 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 43 [2022-07-12 03:40:20,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:20,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:20,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:20,205 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 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-12 03:40:20,208 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:40:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-07-12 03:40:20,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857274890] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:20,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:40:20,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 42 [2022-07-12 03:40:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863173757] [2022-07-12 03:40:20,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:20,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 03:40:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:40:20,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 03:40:20,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1527, Unknown=3, NotChecked=78, Total=1722 [2022-07-12 03:40:20,243 INFO L87 Difference]: Start difference. First operand 182 states and 228 transitions. Second operand has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 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:40:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:27,290 INFO L93 Difference]: Finished difference Result 516 states and 589 transitions. [2022-07-12 03:40:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-12 03:40:27,290 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 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 43 [2022-07-12 03:40:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:27,292 INFO L225 Difference]: With dead ends: 516 [2022-07-12 03:40:27,292 INFO L226 Difference]: Without dead ends: 514 [2022-07-12 03:40:27,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 80 SyntacticMatches, 14 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2788 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1058, Invalid=9419, Unknown=33, NotChecked=202, Total=10712 [2022-07-12 03:40:27,293 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 418 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:27,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1059 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1328 Invalid, 0 Unknown, 630 Unchecked, 0.9s Time] [2022-07-12 03:40:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-07-12 03:40:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 183. [2022-07-12 03:40:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 1.276243093922652) internal successors, (231), 182 states have internal predecessors, (231), 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:40:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 231 transitions. [2022-07-12 03:40:27,351 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 231 transitions. Word has length 43 [2022-07-12 03:40:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:27,352 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 231 transitions. [2022-07-12 03:40:27,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 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:40:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 231 transitions. [2022-07-12 03:40:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:40:27,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:27,352 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:40:27,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-12 03:40:27,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-12 03:40:27,553 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:27,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1120389198, now seen corresponding path program 6 times [2022-07-12 03:40:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:27,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683824427] [2022-07-12 03:40:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:28,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683824427] [2022-07-12 03:40:28,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683824427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:28,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986862576] [2022-07-12 03:40:28,270 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 03:40:28,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:28,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:28,271 INFO L229 MonitoredProcess]: Starting monitored process 28 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:40:28,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-12 03:40:28,510 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-12 03:40:28,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:40:28,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-12 03:40:28,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:28,521 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:40:28,587 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:40:28,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,591 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 20 treesize of output 22 [2022-07-12 03:40:28,604 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:40:28,604 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:40:28,607 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:40:28,691 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:40:28,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,695 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 51 treesize of output 45 [2022-07-12 03:40:28,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,699 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 32 treesize of output 34 [2022-07-12 03:40:28,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,702 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 35 treesize of output 37 [2022-07-12 03:40:28,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,716 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-12 03:40:28,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-07-12 03:40:28,720 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 8 treesize of output 7 [2022-07-12 03:40:28,836 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:40:28,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,849 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-12 03:40:28,850 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 98 treesize of output 70 [2022-07-12 03:40:28,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,855 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 40 treesize of output 42 [2022-07-12 03:40:28,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-07-12 03:40:28,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,871 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-12 03:40:28,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-07-12 03:40:28,875 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 8 treesize of output 7 [2022-07-12 03:40:33,604 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-12 03:40:33,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 171 treesize of output 93 [2022-07-12 03:40:33,616 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-12 03:40:33,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 35 [2022-07-12 03:40:33,669 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 0 case distinctions, treesize of input 30 treesize of output 10 [2022-07-12 03:40:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:33,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:34,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:34,004 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 74 treesize of output 72 [2022-07-12 03:40:34,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:34,009 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 65 treesize of output 63 [2022-07-12 03:40:34,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2306 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_125| Int) (v_arrayElimArr_112 (Array Int Int)) (v_arrayElimArr_111 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2306 4))) (or (<= .cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_125| v_arrayElimArr_112)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_125| v_arrayElimArr_111))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_125| v_ArrVal_2306) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) (not (= (select v_arrayElimArr_111 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_125|))) (not (= (select v_arrayElimArr_112 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (<= |c_ULTIMATE.start_main_~min~0#1| .cse0)))) is different from false [2022-07-12 03:40:34,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:34,076 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 125 treesize of output 123 [2022-07-12 03:40:34,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:34,082 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 116 treesize of output 114 [2022-07-12 03:40:34,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:34,270 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 196 treesize of output 167 [2022-07-12 03:40:34,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:34,277 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 154 treesize of output 125 [2022-07-12 03:40:34,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:34,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:34,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:34,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:34,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:34,285 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 61 [2022-07-12 03:40:34,289 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 106 treesize of output 92 [2022-07-12 03:40:34,292 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 76 treesize of output 64 [2022-07-12 03:40:34,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:34,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:34,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:34,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:34,297 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2022-07-12 03:40:34,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:34,416 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 309 treesize of output 306 [2022-07-12 03:40:34,421 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 286 treesize of output 270 [2022-07-12 03:40:34,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:34,432 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 275 treesize of output 219 [2022-07-12 03:40:34,438 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 106 treesize of output 98 [2022-07-12 03:40:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-12 03:40:34,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986862576] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:34,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:40:34,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 13] total 41 [2022-07-12 03:40:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544019366] [2022-07-12 03:40:34,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:34,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 03:40:34,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:40:34,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 03:40:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1438, Unknown=4, NotChecked=76, Total=1640 [2022-07-12 03:40:34,764 INFO L87 Difference]: Start difference. First operand 183 states and 231 transitions. Second operand has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 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:42:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:42:31,717 INFO L93 Difference]: Finished difference Result 712 states and 848 transitions. [2022-07-12 03:42:31,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-07-12 03:42:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 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 43 [2022-07-12 03:42:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:42:31,719 INFO L225 Difference]: With dead ends: 712 [2022-07-12 03:42:31,720 INFO L226 Difference]: Without dead ends: 710 [2022-07-12 03:42:31,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 88 SyntacticMatches, 15 SemanticMatches, 153 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6970 ImplicationChecksByTransitivity, 120.5s TimeCoverageRelationStatistics Valid=3243, Invalid=20299, Unknown=24, NotChecked=304, Total=23870 [2022-07-12 03:42:31,721 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 423 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 645 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:42:31,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 549 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1724 Invalid, 0 Unknown, 645 Unchecked, 1.4s Time] [2022-07-12 03:42:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-12 03:42:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 90. [2022-07-12 03:42:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 89 states have internal predecessors, (106), 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:42:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-07-12 03:42:31,762 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 43 [2022-07-12 03:42:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:42:31,762 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-07-12 03:42:31,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 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:42:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-07-12 03:42:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 03:42:31,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:42:31,763 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:42:31,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-12 03:42:31,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:31,965 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:42:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:42:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash 970804020, now seen corresponding path program 4 times [2022-07-12 03:42:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:42:31,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413476566] [2022-07-12 03:42:31,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:31,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:42:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:32,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:42:32,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413476566] [2022-07-12 03:42:32,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413476566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:32,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634543227] [2022-07-12 03:42:32,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:42:32,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:42:32,237 INFO L229 MonitoredProcess]: Starting monitored process 29 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:42:32,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-12 03:42:32,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:42:32,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:42:32,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-12 03:42:32,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:42:32,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:42:32,487 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:42:32,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,491 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 18 treesize of output 20 [2022-07-12 03:42:32,503 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:42:32,504 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 21 treesize of output 29 [2022-07-12 03:42:32,511 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:42:32,579 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:42:32,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-07-12 03:42:32,588 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:42:32,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,592 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 22 treesize of output 24 [2022-07-12 03:42:32,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,606 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-12 03:42:32,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-07-12 03:42:32,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,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 18 treesize of output 20 [2022-07-12 03:42:32,742 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:42:32,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,754 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-12 03:42:32,754 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 99 treesize of output 71 [2022-07-12 03:42:32,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,759 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 26 treesize of output 28 [2022-07-12 03:42:32,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2022-07-12 03:42:32,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:32,773 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-12 03:42:32,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2022-07-12 03:42:32,779 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 8 treesize of output 7 [2022-07-12 03:42:33,209 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-12 03:42:33,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 168 treesize of output 90 [2022-07-12 03:42:33,219 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-12 03:42:33,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-12 03:42:33,245 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:42:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:33,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:42:33,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:33,294 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 72 treesize of output 70 [2022-07-12 03:42:33,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:33,297 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 63 treesize of output 61 [2022-07-12 03:42:33,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_121 (Array Int Int)) (v_arrayElimArr_120 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_132| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_132|) 0)) (not (= (select v_arrayElimArr_120 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (<= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_132| v_arrayElimArr_121)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_132| v_arrayElimArr_120))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_132| v_ArrVal_2434) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~max~0#1|) (not (= (select v_arrayElimArr_121 0) |c_ULTIMATE.start_main_~l~0#1.offset|)))) is different from false [2022-07-12 03:42:33,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:33,366 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 115 treesize of output 113 [2022-07-12 03:42:33,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:33,370 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 106 treesize of output 104 [2022-07-12 03:42:33,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_121 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimArr_120 (Array Int Int)) (v_ArrVal_2434 (Array Int Int)) (v_arrayElimArr_123 (Array Int Int)) (v_arrayElimArr_122 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_132| Int)) (let ((.cse0 (select v_arrayElimArr_120 0))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_123 0))) (not (= (select v_arrayElimArr_121 0) 0)) (<= (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_122) |v_ULTIMATE.start_main_~l~0#1.base_132| v_arrayElimArr_121)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_123) |v_ULTIMATE.start_main_~l~0#1.base_132| v_arrayElimArr_120))) (let ((.cse2 (select (select .cse1 .cse0) 0)) (.cse3 (select (select .cse4 .cse0) 0))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2425) |v_ULTIMATE.start_main_~l~0#1.base_132| v_ArrVal_2434) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))) |c_ULTIMATE.start_main_~max~0#1|) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_122 0))) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_132|) 0))))) is different from false [2022-07-12 03:42:33,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:33,452 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 174 treesize of output 149 [2022-07-12 03:42:33,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:33,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 113 [2022-07-12 03:42:33,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:42:33,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:42:33,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:42:33,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:33,463 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 55 [2022-07-12 03:42:33,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:42:33,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 318 [2022-07-12 03:42:33,471 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 351 treesize of output 293 [2022-07-12 03:42:33,473 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 287 treesize of output 235 [2022-07-12 03:42:41,368 WARN L233 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 70 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:42:41,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:41,417 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 483 treesize of output 474 [2022-07-12 03:42:41,425 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 140 treesize of output 120 [2022-07-12 03:42:41,430 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 249 treesize of output 213 [2022-07-12 03:42:41,434 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 206 treesize of output 198 [2022-07-12 03:42:41,612 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 7 treesize of output 3 [2022-07-12 03:42:41,626 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 7 treesize of output 3 [2022-07-12 03:42:41,637 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 7 treesize of output 3 [2022-07-12 03:42:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-12 03:42:42,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634543227] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:42:42,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:42:42,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 30 [2022-07-12 03:42:42,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569731028] [2022-07-12 03:42:42,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:42:42,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 03:42:42,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:42:42,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 03:42:42,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=682, Unknown=2, NotChecked=106, Total=870 [2022-07-12 03:42:42,058 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 30 states, 30 states have (on average 3.5) internal successors, (105), 30 states have internal predecessors, (105), 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:42:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:42:43,812 INFO L93 Difference]: Finished difference Result 255 states and 290 transitions. [2022-07-12 03:42:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 03:42:43,813 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.5) internal successors, (105), 30 states have internal predecessors, (105), 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 45 [2022-07-12 03:42:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:42:43,814 INFO L225 Difference]: With dead ends: 255 [2022-07-12 03:42:43,814 INFO L226 Difference]: Without dead ends: 253 [2022-07-12 03:42:43,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=311, Invalid=2553, Unknown=6, NotChecked=210, Total=3080 [2022-07-12 03:42:43,814 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 251 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:42:43,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 372 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 808 Invalid, 0 Unknown, 389 Unchecked, 0.4s Time] [2022-07-12 03:42:43,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-12 03:42:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 158. [2022-07-12 03:42:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 156 states have (on average 1.2179487179487178) internal successors, (190), 157 states have internal predecessors, (190), 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:42:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2022-07-12 03:42:43,891 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 45 [2022-07-12 03:42:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:42:43,891 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2022-07-12 03:42:43,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.5) internal successors, (105), 30 states have internal predecessors, (105), 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:42:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2022-07-12 03:42:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 03:42:43,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:42:43,891 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:42:43,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-12 03:42:44,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:44,092 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:42:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:42:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1499184312, now seen corresponding path program 7 times [2022-07-12 03:42:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:42:44,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458629981] [2022-07-12 03:42:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:42:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 03:42:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:42:44,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458629981] [2022-07-12 03:42:44,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458629981] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:44,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078084900] [2022-07-12 03:42:44,156 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 03:42:44,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:42:44,171 INFO L229 MonitoredProcess]: Starting monitored process 30 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:42:44,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-12 03:42:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:44,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:42:44,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:42:44,359 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 19 treesize of output 7 [2022-07-12 03:42:44,381 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 03:42:44,382 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 1 case distinctions, treesize of input 16 treesize of output 17 [2022-07-12 03:42:44,400 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 19 treesize of output 7 [2022-07-12 03:42:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 03:42:44,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:42:44,449 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 19 treesize of output 7 [2022-07-12 03:42:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 03:42:44,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078084900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:42:44,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:42:44,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-07-12 03:42:44,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850740130] [2022-07-12 03:42:44,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:42:44,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:42:44,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:42:44,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:42:44,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:42:44,453 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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:42:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:42:44,741 INFO L93 Difference]: Finished difference Result 372 states and 423 transitions. [2022-07-12 03:42:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:42:44,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 45 [2022-07-12 03:42:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:42:44,742 INFO L225 Difference]: With dead ends: 372 [2022-07-12 03:42:44,742 INFO L226 Difference]: Without dead ends: 295 [2022-07-12 03:42:44,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-07-12 03:42:44,743 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 102 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:42:44,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 85 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:42:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-12 03:42:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 135. [2022-07-12 03:42:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 133 states have (on average 1.218045112781955) internal successors, (162), 134 states have internal predecessors, (162), 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:42:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 162 transitions. [2022-07-12 03:42:44,808 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 162 transitions. Word has length 45 [2022-07-12 03:42:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:42:44,809 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 162 transitions. [2022-07-12 03:42:44,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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:42:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 162 transitions. [2022-07-12 03:42:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 03:42:44,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:42:44,810 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:42:44,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-12 03:42:45,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:45,027 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:42:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:42:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1538950708, now seen corresponding path program 3 times [2022-07-12 03:42:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:42:45,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448646318] [2022-07-12 03:42:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:42:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:45,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:42:45,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448646318] [2022-07-12 03:42:45,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448646318] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:45,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676590693] [2022-07-12 03:42:45,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:42:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:42:45,534 INFO L229 MonitoredProcess]: Starting monitored process 31 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:42:45,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-12 03:42:45,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-12 03:42:45,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:42:45,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 03:42:45,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:42:45,735 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:42:45,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:42:45,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:45,797 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 20 treesize of output 22 [2022-07-12 03:42:45,809 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 03:42:45,809 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 21 treesize of output 29 [2022-07-12 03:42:45,812 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:42:45,901 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:42:45,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:45,905 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 51 treesize of output 45 [2022-07-12 03:42:45,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:45,910 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 32 treesize of output 34 [2022-07-12 03:42:45,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:45,913 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 57 treesize of output 47 [2022-07-12 03:42:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:45,939 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-12 03:42:45,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-07-12 03:42:45,943 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 8 treesize of output 7 [2022-07-12 03:42:46,069 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:42:46,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:46,083 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-12 03:42:46,083 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 124 treesize of output 88 [2022-07-12 03:42:46,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:46,089 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 40 treesize of output 42 [2022-07-12 03:42:46,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:46,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:46,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:46,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2022-07-12 03:42:46,100 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 8 treesize of output 7 [2022-07-12 03:42:46,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:46,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:46,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:46,110 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-12 03:42:46,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29