./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 f4b24e32 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-?-f4b24e3 [2022-07-13 15:18:38,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:18:38,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:18:39,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:18:39,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:18:39,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:18:39,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:18:39,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:18:39,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:18:39,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:18:39,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:18:39,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:18:39,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:18:39,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:18:39,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:18:39,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:18:39,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:18:39,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:18:39,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:18:39,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:18:39,054 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:18:39,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:18:39,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:18:39,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:18:39,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:18:39,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:18:39,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:18:39,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:18:39,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:18:39,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:18:39,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:18:39,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:18:39,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:18:39,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:18:39,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:18:39,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:18:39,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:18:39,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:18:39,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:18:39,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:18:39,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:18:39,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:18:39,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:18:39,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:18:39,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:18:39,105 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:18:39,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:18:39,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:18:39,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:18:39,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:18:39,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:18:39,108 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:18:39,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:18:39,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:18:39,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:18:39,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:18:39,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:18:39,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:18:39,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:18:39,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:18:39,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:18:39,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:18:39,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:18:39,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:18:39,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:18:39,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:18:39,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:18:39,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:18:39,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:18:39,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:18:39,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:18:39,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:18:39,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:18:39,113 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:18:39,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:18:39,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:18:39,114 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-13 15:18:39,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:18:39,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:18:39,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:18:39,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:18:39,345 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:18:39,346 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-13 15:18:39,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873e45766/7bf1cc719ecf47bba24076e9bf1482f7/FLAG8e31a8f43 [2022-07-13 15:18:39,868 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:18:39,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/min_max.i [2022-07-13 15:18:39,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873e45766/7bf1cc719ecf47bba24076e9bf1482f7/FLAG8e31a8f43 [2022-07-13 15:18:39,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873e45766/7bf1cc719ecf47bba24076e9bf1482f7 [2022-07-13 15:18:39,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:18:39,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:18:39,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:18:39,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:18:39,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:18:39,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:18:39" (1/1) ... [2022-07-13 15:18:39,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759912af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:39, skipping insertion in model container [2022-07-13 15:18:39,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:18:39" (1/1) ... [2022-07-13 15:18:39,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:18:39,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:18:40,165 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-13 15:18:40,167 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-13 15:18:40,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:18:40,173 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:18:40,214 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-13 15:18:40,214 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-13 15:18:40,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:18:40,231 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:18:40,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40 WrapperNode [2022-07-13 15:18:40,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:18:40,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:18:40,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:18:40,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:18:40,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,263 INFO L137 Inliner]: procedures = 121, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-07-13 15:18:40,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:18:40,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:18:40,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:18:40,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:18:40,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:18:40,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:18:40,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:18:40,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:18:40,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (1/1) ... [2022-07-13 15:18:40,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:18:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:40,332 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-13 15:18:40,347 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-13 15:18:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:18:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:18:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:18:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:18:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:18:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:18:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:18:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:18:40,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:18:40,440 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:18:40,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:18:40,563 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:18:40,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:18:40,568 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 15:18:40,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:40 BoogieIcfgContainer [2022-07-13 15:18:40,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:18:40,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:18:40,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:18:40,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:18:40,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:18:39" (1/3) ... [2022-07-13 15:18:40,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b87f9d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:18:40, skipping insertion in model container [2022-07-13 15:18:40,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:40" (2/3) ... [2022-07-13 15:18:40,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b87f9d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:18:40, skipping insertion in model container [2022-07-13 15:18:40,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:40" (3/3) ... [2022-07-13 15:18:40,584 INFO L111 eAbstractionObserver]: Analyzing ICFG min_max.i [2022-07-13 15:18:40,594 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:18:40,594 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 15:18:40,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:18:40,630 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@77ad620b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10cee215 [2022-07-13 15:18:40,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-13 15:18:40,633 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-13 15:18:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 15:18:40,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:40,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:40,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1825905474, now seen corresponding path program 1 times [2022-07-13 15:18:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:40,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901975723] [2022-07-13 15:18:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:40,758 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-13 15:18:40,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:40,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901975723] [2022-07-13 15:18:40,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901975723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:40,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:40,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:18:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369338394] [2022-07-13 15:18:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:40,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:18:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:18:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:18:40,789 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-13 15:18:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:40,799 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-13 15:18:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:18:40,801 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-13 15:18:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:40,806 INFO L225 Difference]: With dead ends: 33 [2022-07-13 15:18:40,806 INFO L226 Difference]: Without dead ends: 17 [2022-07-13 15:18:40,808 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-13 15:18:40,812 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-13 15:18:40,813 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-13 15:18:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-13 15:18:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 15:18:40,835 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-13 15:18:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-13 15:18:40,837 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 7 [2022-07-13 15:18:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:40,837 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-13 15:18:40,837 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-13 15:18:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-13 15:18:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 15:18:40,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:40,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:40,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:18:40,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash 178093936, now seen corresponding path program 1 times [2022-07-13 15:18:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:40,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708106988] [2022-07-13 15:18:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:40,949 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-13 15:18:40,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708106988] [2022-07-13 15:18:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708106988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:40,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:40,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:18:40,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003287958] [2022-07-13 15:18:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:40,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:18:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:18:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:18:40,956 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-13 15:18:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:40,990 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-07-13 15:18:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:18:40,991 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-13 15:18:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:40,992 INFO L225 Difference]: With dead ends: 30 [2022-07-13 15:18:40,992 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 15:18:40,993 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-13 15:18:40,994 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-13 15:18:40,995 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-13 15:18:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 15:18:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 15:18:41,001 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-13 15:18:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-13 15:18:41,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 8 [2022-07-13 15:18:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:41,005 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-13 15:18:41,005 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-13 15:18:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-13 15:18:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:18:41,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:41,006 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:41,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:18:41,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:41,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1651856839, now seen corresponding path program 1 times [2022-07-13 15:18:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:41,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448685530] [2022-07-13 15:18:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:41,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:41,152 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-13 15:18:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:41,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448685530] [2022-07-13 15:18:41,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448685530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:41,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:41,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:18:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334521206] [2022-07-13 15:18:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:41,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:18:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:18:41,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:18:41,157 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-13 15:18:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:41,249 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-07-13 15:18:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:18:41,249 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-13 15:18:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:41,250 INFO L225 Difference]: With dead ends: 28 [2022-07-13 15:18:41,251 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 15:18:41,252 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-13 15:18:41,253 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-13 15:18:41,253 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-13 15:18:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 15:18:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-07-13 15:18:41,256 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-13 15:18:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-13 15:18:41,256 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-13 15:18:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:41,257 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-13 15:18:41,257 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-13 15:18:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-13 15:18:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:18:41,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:41,257 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:41,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:18:41,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1703602811, now seen corresponding path program 1 times [2022-07-13 15:18:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:41,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252089385] [2022-07-13 15:18:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:41,362 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-13 15:18:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:41,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252089385] [2022-07-13 15:18:41,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252089385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:41,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:41,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 15:18:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812446902] [2022-07-13 15:18:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:41,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:18:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:18:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:18:41,364 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-13 15:18:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:41,470 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-07-13 15:18:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:18:41,470 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-13 15:18:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:41,471 INFO L225 Difference]: With dead ends: 40 [2022-07-13 15:18:41,471 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 15:18:41,471 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-13 15:18:41,476 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-13 15:18:41,477 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-13 15:18:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 15:18:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-07-13 15:18:41,485 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-13 15:18:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-13 15:18:41,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2022-07-13 15:18:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:41,486 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-13 15:18:41,486 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-13 15:18:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-13 15:18:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:18:41,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:41,486 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:41,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:18:41,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:41,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1911306115, now seen corresponding path program 1 times [2022-07-13 15:18:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:41,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358764470] [2022-07-13 15:18:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:41,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:41,530 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-13 15:18:41,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:41,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358764470] [2022-07-13 15:18:41,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358764470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:41,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:41,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:18:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251967328] [2022-07-13 15:18:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:41,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:18:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:41,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:18:41,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:18:41,535 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-13 15:18:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:41,576 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-13 15:18:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:18:41,577 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-13 15:18:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:41,577 INFO L225 Difference]: With dead ends: 55 [2022-07-13 15:18:41,577 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 15:18:41,578 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-13 15:18:41,578 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-13 15:18:41,578 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-13 15:18:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 15:18:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 15:18:41,581 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-13 15:18:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-13 15:18:41,581 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 15 [2022-07-13 15:18:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:41,581 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-13 15:18:41,581 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-13 15:18:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-13 15:18:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:18:41,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:41,582 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:41,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:18:41,582 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1682596603, now seen corresponding path program 1 times [2022-07-13 15:18:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:41,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14020142] [2022-07-13 15:18:41,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:41,736 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-13 15:18:41,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:41,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14020142] [2022-07-13 15:18:41,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14020142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:41,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:41,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 15:18:41,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659206610] [2022-07-13 15:18:41,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:41,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 15:18:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 15:18:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:18:41,737 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-13 15:18:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:41,854 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-07-13 15:18:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:18:41,854 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-13 15:18:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:41,855 INFO L225 Difference]: With dead ends: 36 [2022-07-13 15:18:41,855 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 15:18:41,855 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-13 15:18:41,856 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-13 15:18:41,856 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-13 15:18:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 15:18:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-07-13 15:18:41,859 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-13 15:18:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-13 15:18:41,859 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2022-07-13 15:18:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:41,859 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-13 15:18:41,859 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-13 15:18:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-13 15:18:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 15:18:41,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:41,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:41,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:18:41,861 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:41,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1593313461, now seen corresponding path program 1 times [2022-07-13 15:18:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:41,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785630215] [2022-07-13 15:18:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:41,946 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-13 15:18:41,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:41,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785630215] [2022-07-13 15:18:41,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785630215] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:41,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056528980] [2022-07-13 15:18:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:41,948 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-13 15:18:41,949 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-13 15:18:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:42,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 15:18:42,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:42,132 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-13 15:18:42,140 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-13 15:18:42,220 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-13 15:18:42,223 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-13 15:18:42,226 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-13 15:18:42,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:42,290 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-13 15:18:42,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056528980] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:42,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:42,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-07-13 15:18:42,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782663771] [2022-07-13 15:18:42,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:42,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 15:18:42,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:42,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 15:18:42,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:18:42,292 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-13 15:18:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:42,397 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-07-13 15:18:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:18:42,398 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-13 15:18:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:42,399 INFO L225 Difference]: With dead ends: 46 [2022-07-13 15:18:42,399 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 15:18:42,399 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-13 15:18:42,400 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-13 15:18:42,400 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-13 15:18:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 15:18:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-13 15:18:42,407 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-13 15:18:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-13 15:18:42,408 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2022-07-13 15:18:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:42,408 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-13 15:18:42,408 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-13 15:18:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-13 15:18:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:18:42,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:42,409 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:42,429 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-13 15:18:42,625 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-13 15:18:42,626 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1667695916, now seen corresponding path program 2 times [2022-07-13 15:18:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:42,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280966160] [2022-07-13 15:18:42,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:42,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:42,700 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-13 15:18:42,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280966160] [2022-07-13 15:18:42,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280966160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848667166] [2022-07-13 15:18:42,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:18:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:42,704 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-13 15:18:42,705 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-13 15:18:42,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:18:42,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:42,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:18:42,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:42,882 INFO L356 Elim1Store]: treesize reduction 77, result has 31.9 percent of original size [2022-07-13 15:18:42,882 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-13 15:18:42,921 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-13 15:18:42,943 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-13 15:18:42,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:42,991 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-13 15:18:42,994 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-13 15:18:42,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848667166] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:42,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:42,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-07-13 15:18:42,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816369198] [2022-07-13 15:18:42,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:42,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:18:42,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:42,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:18:42,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:18:42,996 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-13 15:18:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:43,187 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2022-07-13 15:18:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 15:18:43,188 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-13 15:18:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:43,189 INFO L225 Difference]: With dead ends: 109 [2022-07-13 15:18:43,189 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 15:18:43,189 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-13 15:18:43,190 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-13 15:18:43,190 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-13 15:18:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 15:18:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2022-07-13 15:18:43,195 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-13 15:18:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-07-13 15:18:43,195 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2022-07-13 15:18:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:43,196 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-07-13 15:18:43,196 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-13 15:18:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-07-13 15:18:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:18:43,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:43,196 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:43,226 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-13 15:18:43,408 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-13 15:18:43,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1409530478, now seen corresponding path program 1 times [2022-07-13 15:18:43,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:43,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279020029] [2022-07-13 15:18:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:43,784 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-13 15:18:43,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:43,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279020029] [2022-07-13 15:18:43,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279020029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:43,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196418348] [2022-07-13 15:18:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:43,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:43,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:43,785 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-13 15:18:43,786 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-13 15:18:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:43,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 15:18:43,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:43,862 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-13 15:18:43,937 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-13 15:18:43,942 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-13 15:18:43,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:43,966 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-13 15:18:43,972 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:43,973 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-13 15:18:44,093 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-13 15:18:44,097 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-13 15:18:44,122 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-13 15:18:44,125 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-13 15:18:44,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:44,193 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-13 15:18:44,222 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-13 15:18:44,233 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-13 15:18:44,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196418348] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:44,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:44,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 24 [2022-07-13 15:18:44,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473306223] [2022-07-13 15:18:44,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:44,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 15:18:44,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:44,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 15:18:44,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=411, Unknown=2, NotChecked=82, Total=552 [2022-07-13 15:18:44,236 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-13 15:18:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:46,671 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2022-07-13 15:18:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-13 15:18:46,672 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-13 15:18:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:46,673 INFO L225 Difference]: With dead ends: 203 [2022-07-13 15:18:46,673 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 15:18:46,674 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-13 15:18:46,674 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-13 15:18:46,675 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-13 15:18:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 15:18:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 70. [2022-07-13 15:18:46,697 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-13 15:18:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-07-13 15:18:46,697 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 23 [2022-07-13 15:18:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:46,698 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-07-13 15:18:46,698 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-13 15:18:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-07-13 15:18:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:18:46,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:46,698 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:46,717 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-13 15:18:46,911 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-13 15:18:46,913 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1032365076, now seen corresponding path program 1 times [2022-07-13 15:18:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:46,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274795532] [2022-07-13 15:18:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:46,969 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-13 15:18:46,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:46,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274795532] [2022-07-13 15:18:46,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274795532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:46,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345338093] [2022-07-13 15:18:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:46,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:46,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:46,971 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-13 15:18:46,972 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-13 15:18:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:47,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 15:18:47,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:47,048 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-13 15:18:47,095 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-13 15:18:47,097 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-13 15:18:47,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:47,126 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-13 15:18:47,147 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-13 15:18:47,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345338093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:47,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:47,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-13 15:18:47,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137964212] [2022-07-13 15:18:47,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:47,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:18:47,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:47,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:18:47,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:18:47,148 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-13 15:18:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:47,288 INFO L93 Difference]: Finished difference Result 197 states and 236 transitions. [2022-07-13 15:18:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:18:47,288 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-13 15:18:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:47,289 INFO L225 Difference]: With dead ends: 197 [2022-07-13 15:18:47,289 INFO L226 Difference]: Without dead ends: 156 [2022-07-13 15:18:47,290 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-13 15:18:47,290 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-13 15:18:47,290 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-13 15:18:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-13 15:18:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 80. [2022-07-13 15:18:47,296 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-13 15:18:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2022-07-13 15:18:47,297 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 23 [2022-07-13 15:18:47,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:47,297 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2022-07-13 15:18:47,298 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-13 15:18:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-07-13 15:18:47,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:18:47,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:47,298 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:47,318 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-13 15:18:47,511 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-13 15:18:47,511 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1290530514, now seen corresponding path program 1 times [2022-07-13 15:18:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:47,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404106904] [2022-07-13 15:18:47,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:47,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:47,669 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-13 15:18:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:47,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404106904] [2022-07-13 15:18:47,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404106904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:47,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881723683] [2022-07-13 15:18:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:47,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:47,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:47,672 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-13 15:18:47,673 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-13 15:18:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:47,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 15:18:47,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:47,738 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-13 15:18:47,774 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-13 15:18:47,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:18:47,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:47,783 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-13 15:18:47,789 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:47,790 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-13 15:18:47,934 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-13 15:18:47,937 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-13 15:18:47,971 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:18:47,971 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-13 15:18:47,990 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-13 15:18:47,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:48,117 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-13 15:18:48,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:48,147 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-13 15:18:48,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:48,155 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-13 15:18:48,263 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-13 15:18:48,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881723683] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:48,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:48,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2022-07-13 15:18:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378597305] [2022-07-13 15:18:48,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:48,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 15:18:48,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:48,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 15:18:48,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=398, Unknown=1, NotChecked=40, Total=506 [2022-07-13 15:18:48,265 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-13 15:18:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:48,748 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2022-07-13 15:18:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 15:18:48,749 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-13 15:18:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:48,750 INFO L225 Difference]: With dead ends: 112 [2022-07-13 15:18:48,750 INFO L226 Difference]: Without dead ends: 110 [2022-07-13 15:18:48,750 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-13 15:18:48,751 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-13 15:18:48,751 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-13 15:18:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-13 15:18:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 54. [2022-07-13 15:18:48,757 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-13 15:18:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-07-13 15:18:48,758 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 23 [2022-07-13 15:18:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:48,758 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-07-13 15:18:48,758 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-13 15:18:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-07-13 15:18:48,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:18:48,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:48,759 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:48,780 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-13 15:18:48,964 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-13 15:18:48,964 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1643965548, now seen corresponding path program 1 times [2022-07-13 15:18:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:48,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886670588] [2022-07-13 15:18:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:49,056 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-13 15:18:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:49,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886670588] [2022-07-13 15:18:49,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886670588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:49,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842234323] [2022-07-13 15:18:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:49,057 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-13 15:18:49,058 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-13 15:18:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:49,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-13 15:18:49,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:49,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:18:49,193 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-13 15:18:49,197 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-13 15:18:49,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:49,202 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-13 15:18:49,209 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:49,209 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-13 15:18:49,300 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-13 15:18:49,303 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-13 15:18:49,330 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-13 15:18:49,332 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-13 15:18:49,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:49,362 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-13 15:18:49,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:49,374 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-13 15:18:49,376 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-13 15:18:49,430 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-13 15:18:49,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842234323] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:49,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:49,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2022-07-13 15:18:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361237938] [2022-07-13 15:18:49,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:49,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 15:18:49,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:49,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 15:18:49,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=203, Unknown=1, NotChecked=28, Total=272 [2022-07-13 15:18:49,431 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-13 15:18:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:49,828 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-07-13 15:18:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:18:49,829 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-13 15:18:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:49,829 INFO L225 Difference]: With dead ends: 111 [2022-07-13 15:18:49,829 INFO L226 Difference]: Without dead ends: 109 [2022-07-13 15:18:49,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=466, Unknown=1, NotChecked=46, Total=650 [2022-07-13 15:18:49,830 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-13 15:18:49,830 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-13 15:18:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-13 15:18:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 82. [2022-07-13 15:18:49,836 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-13 15:18:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-07-13 15:18:49,837 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 25 [2022-07-13 15:18:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:49,837 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-07-13 15:18:49,837 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-13 15:18:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-07-13 15:18:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:18:49,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:49,838 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:49,865 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-13 15:18:50,039 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-13 15:18:50,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1055550124, now seen corresponding path program 1 times [2022-07-13 15:18:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:50,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131379612] [2022-07-13 15:18:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:50,258 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-13 15:18:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:50,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131379612] [2022-07-13 15:18:50,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131379612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:50,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491389034] [2022-07-13 15:18:50,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:50,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:50,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:50,265 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-13 15:18:50,267 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-13 15:18:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:50,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 15:18:50,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:50,368 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-13 15:18:50,372 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-13 15:18:50,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:18:50,417 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-13 15:18:50,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:50,421 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-13 15:18:50,426 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:50,426 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-13 15:18:50,578 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-13 15:18:50,580 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-13 15:18:50,617 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:18:50,617 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-13 15:18:50,628 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-13 15:18:50,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:50,748 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-13 15:18:50,763 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-13 15:18:50,779 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-13 15:18:50,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491389034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:50,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:50,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 26 [2022-07-13 15:18:50,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393374382] [2022-07-13 15:18:50,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:50,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 15:18:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 15:18:50,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=477, Unknown=2, NotChecked=90, Total=650 [2022-07-13 15:18:50,781 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-13 15:18:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:51,776 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2022-07-13 15:18:51,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:18:51,777 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-13 15:18:51,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:51,777 INFO L225 Difference]: With dead ends: 133 [2022-07-13 15:18:51,777 INFO L226 Difference]: Without dead ends: 131 [2022-07-13 15:18:51,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=1396, Unknown=2, NotChecked=162, Total=1892 [2022-07-13 15:18:51,779 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:51,779 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.2s Time] [2022-07-13 15:18:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-13 15:18:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 84. [2022-07-13 15:18:51,786 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-13 15:18:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2022-07-13 15:18:51,787 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 25 [2022-07-13 15:18:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:51,787 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2022-07-13 15:18:51,787 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-13 15:18:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2022-07-13 15:18:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:18:51,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:51,788 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-13 15:18:51,806 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-13 15:18:51,999 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-13 15:18:52,000 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1550473430, now seen corresponding path program 1 times [2022-07-13 15:18:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:52,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404048643] [2022-07-13 15:18:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:52,227 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-13 15:18:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:52,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404048643] [2022-07-13 15:18:52,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404048643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:52,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146887967] [2022-07-13 15:18:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:52,229 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-13 15:18:52,229 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-13 15:18:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:52,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 15:18:52,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:52,300 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-13 15:18:52,357 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-13 15:18:52,366 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-13 15:18:52,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:52,371 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-13 15:18:52,378 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:52,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-13 15:18:52,579 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-13 15:18:52,582 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-13 15:18:52,637 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-13 15:18:52,655 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-13 15:18:52,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:52,796 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-13 15:18:52,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:52,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 44 [2022-07-13 15:18:52,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:52,826 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-13 15:18:52,931 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-13 15:18:52,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146887967] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:52,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:52,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2022-07-13 15:18:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014672031] [2022-07-13 15:18:52,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:52,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 15:18:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 15:18:52,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=630, Unknown=1, NotChecked=50, Total=756 [2022-07-13 15:18:52,933 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-13 15:18:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:55,879 INFO L93 Difference]: Finished difference Result 319 states and 367 transitions. [2022-07-13 15:18:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-13 15:18:55,880 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-13 15:18:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:55,881 INFO L225 Difference]: With dead ends: 319 [2022-07-13 15:18:55,881 INFO L226 Difference]: Without dead ends: 317 [2022-07-13 15:18:55,882 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-13 15:18:55,882 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-13 15:18:55,883 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-13 15:18:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-13 15:18:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 99. [2022-07-13 15:18:55,891 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-13 15:18:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2022-07-13 15:18:55,892 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 25 [2022-07-13 15:18:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:55,892 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2022-07-13 15:18:55,892 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-13 15:18:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2022-07-13 15:18:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:18:55,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:55,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:55,910 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-13 15:18:56,107 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-13 15:18:56,110 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash 138316690, now seen corresponding path program 2 times [2022-07-13 15:18:56,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:56,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829987972] [2022-07-13 15:18:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:56,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:56,236 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-13 15:18:56,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:56,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829987972] [2022-07-13 15:18:56,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829987972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:56,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981665923] [2022-07-13 15:18:56,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:18:56,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:56,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:56,238 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-13 15:18:56,238 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-13 15:18:56,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:18:56,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:56,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-13 15:18:56,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:56,321 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-13 15:18:56,324 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-13 15:18:56,329 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-13 15:18:56,363 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-13 15:18:56,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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-13 15:18:56,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:56,369 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-13 15:18:56,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:56,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:18:56,379 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:56,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-13 15:18:56,560 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-13 15:18:56,560 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-13 15:18:56,566 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:18:56,566 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-13 15:18:56,569 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-13 15:18:56,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:56,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,614 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-13 15:18:56,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,619 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-13 15:18:56,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_30| Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_30| (store v_ArrVal_542 0 |c_ULTIMATE.start_main_~l~0#1.base|)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_30| (store v_ArrVal_538 0 |c_ULTIMATE.start_main_~l~0#1.offset|)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_30|) 0)))) is different from false [2022-07-13 15:18:56,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,642 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-13 15:18:56,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,648 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-13 15:18:56,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,668 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-13 15:18:56,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,674 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-13 15:18:56,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,695 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-13 15:18:56,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,702 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-13 15:18:56,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,723 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-13 15:18:56,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,730 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-13 15:18:56,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-13 15:18:56,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,756 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-13 15:18:56,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:56,759 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-13 15:18:56,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-13 15:18:56,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:56,766 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 21 treesize of output 22 [2022-07-13 15:18:56,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:56,769 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-13 15:18:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-13 15:18:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981665923] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:56,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:56,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2022-07-13 15:18:56,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197065960] [2022-07-13 15:18:56,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:56,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 15:18:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 15:18:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2022-07-13 15:18:56,776 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-13 15:18:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:56,966 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2022-07-13 15:18:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:18:56,967 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-13 15:18:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:56,968 INFO L225 Difference]: With dead ends: 138 [2022-07-13 15:18:56,968 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 15:18:56,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2022-07-13 15:18:56,968 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:56,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 176 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-07-13 15:18:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 15:18:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-13 15:18:56,977 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-13 15:18:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2022-07-13 15:18:56,977 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 28 [2022-07-13 15:18:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:56,977 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2022-07-13 15:18:56,977 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-13 15:18:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2022-07-13 15:18:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:18:56,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:56,978 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:56,994 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-13 15:18:57,192 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-13 15:18:57,192 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2085718163, now seen corresponding path program 2 times [2022-07-13 15:18:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:57,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575438929] [2022-07-13 15:18:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:57,461 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-13 15:18:57,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:57,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575438929] [2022-07-13 15:18:57,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575438929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:57,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824315733] [2022-07-13 15:18:57,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:18:57,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:57,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:57,462 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-13 15:18:57,463 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-13 15:18:57,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:18:57,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:57,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 15:18:57,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:57,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:18:57,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,635 INFO L356 Elim1Store]: treesize reduction 56, result has 31.7 percent of original size [2022-07-13 15:18:57,635 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-13 15:18:57,683 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-13 15:18:57,689 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-13 15:18:57,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:57,692 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-13 15:18:57,700 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:57,700 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-13 15:18:57,825 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-13 15:18:57,828 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-13 15:18:57,857 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-13 15:18:57,875 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-13 15:18:57,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:57,956 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-13 15:18:57,984 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-13 15:18:57,991 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-13 15:18:58,007 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-13 15:18:58,078 INFO L356 Elim1Store]: treesize reduction 51, result has 48.5 percent of original size [2022-07-13 15:18:58,079 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-13 15:18:58,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:58,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:58,086 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-13 15:18:58,094 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-13 15:18:58,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824315733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:58,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:58,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-07-13 15:18:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365199997] [2022-07-13 15:18:58,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:58,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 15:18:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 15:18:58,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=634, Unknown=3, NotChecked=156, Total=870 [2022-07-13 15:18:58,095 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-13 15:19:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:04,832 INFO L93 Difference]: Finished difference Result 499 states and 583 transitions. [2022-07-13 15:19:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-13 15:19:04,832 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-13 15:19:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:04,833 INFO L225 Difference]: With dead ends: 499 [2022-07-13 15:19:04,833 INFO L226 Difference]: Without dead ends: 497 [2022-07-13 15:19:04,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2484, Invalid=11565, Unknown=5, NotChecked=708, Total=14762 [2022-07-13 15:19:04,836 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 530 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 463 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:04,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 236 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 640 Invalid, 0 Unknown, 463 Unchecked, 0.4s Time] [2022-07-13 15:19:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-07-13 15:19:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 183. [2022-07-13 15:19:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 1.3591160220994476) internal successors, (246), 182 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-13 15:19:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 246 transitions. [2022-07-13 15:19:04,853 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 246 transitions. Word has length 30 [2022-07-13 15:19:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:04,853 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 246 transitions. [2022-07-13 15:19:04,853 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-13 15:19:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 246 transitions. [2022-07-13 15:19:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:19:04,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:04,854 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-13 15:19:04,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 15:19:05,054 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-13 15:19:05,054 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:05,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1136640527, now seen corresponding path program 2 times [2022-07-13 15:19:05,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:05,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236550305] [2022-07-13 15:19:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:05,404 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-13 15:19:05,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236550305] [2022-07-13 15:19:05,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236550305] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967713196] [2022-07-13 15:19:05,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:19:05,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:05,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:05,415 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-13 15:19:05,415 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-13 15:19:05,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:19:05,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:05,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 15:19:05,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:05,504 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-13 15:19:05,556 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-13 15:19:05,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:05,560 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-13 15:19:05,565 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:19:05,565 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-13 15:19:05,573 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-13 15:19:05,725 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-13 15:19:05,728 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-13 15:19:05,765 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:05,765 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-13 15:19:05,781 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-13 15:19:05,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:05,937 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-13 15:19:05,951 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-13 15:19:05,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:05,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 15:19:05,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:05,965 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-13 15:19:06,122 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-13 15:19:06,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967713196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:06,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:06,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 32 [2022-07-13 15:19:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905751468] [2022-07-13 15:19:06,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:06,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 15:19:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:06,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 15:19:06,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=776, Unknown=2, NotChecked=114, Total=992 [2022-07-13 15:19:06,124 INFO L87 Difference]: Start difference. First operand 183 states and 246 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-13 15:19:06,615 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-13 15:19:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:09,486 INFO L93 Difference]: Finished difference Result 511 states and 636 transitions. [2022-07-13 15:19:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-13 15:19:09,487 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-13 15:19:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:09,491 INFO L225 Difference]: With dead ends: 511 [2022-07-13 15:19:09,491 INFO L226 Difference]: Without dead ends: 509 [2022-07-13 15:19:09,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 52 SyntacticMatches, 15 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3508 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1318, Invalid=8788, Unknown=6, NotChecked=600, Total=10712 [2022-07-13 15:19:09,494 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 271 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:09,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 385 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 992 Invalid, 0 Unknown, 389 Unchecked, 0.6s Time] [2022-07-13 15:19:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-07-13 15:19:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 141. [2022-07-13 15:19:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 139 states have (on average 1.316546762589928) internal successors, (183), 140 states have internal predecessors, (183), 0 states have call successors, (0), 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-13 15:19:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2022-07-13 15:19:09,511 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 30 [2022-07-13 15:19:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:09,511 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2022-07-13 15:19:09,512 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-13 15:19:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2022-07-13 15:19:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:19:09,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:09,512 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:09,533 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-13 15:19:09,722 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-13 15:19:09,722 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1260702929, now seen corresponding path program 1 times [2022-07-13 15:19:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:09,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122297626] [2022-07-13 15:19:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:10,104 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-13 15:19:10,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:10,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122297626] [2022-07-13 15:19:10,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122297626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:10,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618508005] [2022-07-13 15:19:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:10,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:10,106 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-13 15:19:10,109 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-13 15:19:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:10,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 15:19:10,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:10,192 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-13 15:19:10,281 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-13 15:19:10,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-13 15:19:10,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,288 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-13 15:19:10,294 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:19:10,294 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-13 15:19:10,391 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-13 15:19:10,394 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-13 15:19:10,415 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-13 15:19:10,417 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-13 15:19:10,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:10,495 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-13 15:19:10,506 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-13 15:19:10,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:10,513 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-13 15:19:10,517 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-13 15:19:10,568 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-13 15:19:10,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618508005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:10,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:10,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 29 [2022-07-13 15:19:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502319395] [2022-07-13 15:19:10,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:10,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 15:19:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:10,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 15:19:10,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=630, Unknown=2, NotChecked=102, Total=812 [2022-07-13 15:19:10,569 INFO L87 Difference]: Start difference. First operand 141 states and 183 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-13 15:19:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:12,831 INFO L93 Difference]: Finished difference Result 312 states and 383 transitions. [2022-07-13 15:19:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 15:19:12,831 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-13 15:19:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:12,832 INFO L225 Difference]: With dead ends: 312 [2022-07-13 15:19:12,832 INFO L226 Difference]: Without dead ends: 310 [2022-07-13 15:19:12,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=719, Invalid=3192, Unknown=3, NotChecked=246, Total=4160 [2022-07-13 15:19:12,833 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 217 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:12,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 206 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 635 Invalid, 0 Unknown, 188 Unchecked, 0.3s Time] [2022-07-13 15:19:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-13 15:19:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 77. [2022-07-13 15:19:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 76 states have internal predecessors, (94), 0 states have call successors, (0), 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-13 15:19:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2022-07-13 15:19:12,844 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 30 [2022-07-13 15:19:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:12,844 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2022-07-13 15:19:12,844 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-13 15:19:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2022-07-13 15:19:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:19:12,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:12,845 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:12,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:19:13,059 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-13 15:19:13,059 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -334041831, now seen corresponding path program 3 times [2022-07-13 15:19:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932605184] [2022-07-13 15:19:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:13,216 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-13 15:19:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:13,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932605184] [2022-07-13 15:19:13,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932605184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:13,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213087004] [2022-07-13 15:19:13,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:19:13,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:13,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:13,218 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-13 15:19:13,258 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-13 15:19:13,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 15:19:13,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:13,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-13 15:19:13,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:13,342 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-13 15:19:13,394 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-13 15:19:13,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19: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 18 treesize of output 20 [2022-07-13 15:19:13,409 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:13,410 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-13 15:19:13,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:19:13,485 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-13 15:19:13,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,499 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-13 15:19:13,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,506 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-13 15:19:13,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,518 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:13,518 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-13 15:19:13,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:13,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 21 treesize of output 23 [2022-07-13 15:19:13,527 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-13 15:19:13,755 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:19:13,756 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-13 15:19:13,763 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:13,763 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-13 15:19:13,784 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-13 15:19:13,785 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-13 15:19:13,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:13,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:13,822 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-13 15:19:13,827 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:13,827 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-13 15:19:13,836 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_arrayElimArr_19 (Array Int Int)) (v_arrayElimArr_18 (Array Int 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_18) |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_19) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4))) (not (= (select v_arrayElimArr_18 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_46|) 0)) (not (= (select v_arrayElimArr_19 0) |c_ULTIMATE.start_main_~l~0#1.offset|)))) is different from false [2022-07-13 15:19:13,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:13,879 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-13 15:19:13,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:13,883 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-13 15:19:13,885 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-13 15:19:13,888 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:13,889 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-13 15:19:13,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:13,891 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-13 15:19:13,952 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-13 15:19:13,958 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-13 15:19:13,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213087004] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:13,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:13,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 23 [2022-07-13 15:19:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184782137] [2022-07-13 15:19:13,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:13,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 15:19:13,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:13,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 15:19:13,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=8, NotChecked=78, Total=506 [2022-07-13 15:19:13,960 INFO L87 Difference]: Start difference. First operand 77 states and 94 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-13 15:19:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:14,787 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2022-07-13 15:19:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:19:14,788 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-13 15:19:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:14,788 INFO L225 Difference]: With dead ends: 128 [2022-07-13 15:19:14,788 INFO L226 Difference]: Without dead ends: 126 [2022-07-13 15:19:14,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=956, Unknown=11, NotChecked=134, Total=1332 [2022-07-13 15:19:14,789 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 86 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:14,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 193 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 245 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-07-13 15:19:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-13 15:19:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2022-07-13 15:19:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 113 states have internal predecessors, (141), 0 states have call successors, (0), 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-13 15:19:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2022-07-13 15:19:14,806 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 33 [2022-07-13 15:19:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:14,806 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2022-07-13 15:19:14,806 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-13 15:19:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2022-07-13 15:19:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:19:14,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:14,806 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-13 15:19:14,824 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-13 15:19:15,019 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-13 15:19:15,019 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1354901911, now seen corresponding path program 1 times [2022-07-13 15:19:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:15,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211662653] [2022-07-13 15:19:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:15,236 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-13 15:19:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:15,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211662653] [2022-07-13 15:19:15,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211662653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:15,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011332516] [2022-07-13 15:19:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:15,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:15,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:15,238 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-13 15:19:15,238 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-13 15:19:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:15,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-13 15:19:15,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:15,333 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-13 15:19:15,370 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-13 15:19:15,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:15,377 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-13 15:19:15,387 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:15,388 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-13 15:19:15,394 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-13 15:19:15,462 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-13 15:19:15,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:15,468 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-13 15:19:15,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:15,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, 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-13 15:19:15,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:15,482 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:15,482 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-13 15:19:15,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:15,486 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-13 15:19:15,490 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-13 15:19:15,764 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:19:15,765 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-13 15:19:15,770 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:15,770 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-13 15:19:15,798 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:15,799 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-13 15:19:15,809 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-13 15:19:15,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:15,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:15,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-13 15:19:15,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:15,947 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-13 15:19:15,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_51| Int) (v_arrayElimArr_24 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse0 (select v_ArrVal_980 4))) (or (<= .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_23) |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_51| v_arrayElimArr_24) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4))) (not (= (select v_arrayElimArr_24 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_23 0))) (<= |c_ULTIMATE.start_main_~min~0#1| .cse0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_51|) 0))))) is different from false [2022-07-13 15:19:16,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:16,018 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-13 15:19:16,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:16,021 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-13 15:19:16,025 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-13 15:19:16,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:16,030 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-13 15:19:16,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:16,033 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-13 15:19:16,105 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-13 15:19:16,112 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-13 15:19:16,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011332516] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:16,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:16,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2022-07-13 15:19:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622810237] [2022-07-13 15:19:16,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:16,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 15:19:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 15:19:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=677, Unknown=4, NotChecked=106, Total=870 [2022-07-13 15:19:16,114 INFO L87 Difference]: Start difference. First operand 114 states and 141 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-13 15:19:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:17,993 INFO L93 Difference]: Finished difference Result 215 states and 259 transitions. [2022-07-13 15:19:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 15:19:17,993 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-13 15:19:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:17,994 INFO L225 Difference]: With dead ends: 215 [2022-07-13 15:19:17,994 INFO L226 Difference]: Without dead ends: 213 [2022-07-13 15:19:17,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=531, Invalid=2551, Unknown=6, NotChecked=218, Total=3306 [2022-07-13 15:19:17,995 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 157 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:17,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 231 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 358 Invalid, 0 Unknown, 188 Unchecked, 0.2s Time] [2022-07-13 15:19:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-13 15:19:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 119. [2022-07-13 15:19:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 118 states have internal predecessors, (149), 0 states have call successors, (0), 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-13 15:19:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 149 transitions. [2022-07-13 15:19:18,012 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 149 transitions. Word has length 33 [2022-07-13 15:19:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:18,013 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 149 transitions. [2022-07-13 15:19:18,013 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-13 15:19:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2022-07-13 15:19:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:19:18,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:18,013 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-13 15:19:18,030 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-13 15:19:18,218 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-13 15:19:18,218 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:18,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:18,218 INFO L85 PathProgramCache]: Analyzing trace with hash -200028325, now seen corresponding path program 2 times [2022-07-13 15:19:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:18,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026601517] [2022-07-13 15:19:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:18,476 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-13 15:19:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:18,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026601517] [2022-07-13 15:19:18,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026601517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:18,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399872790] [2022-07-13 15:19:18,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:19:18,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:18,478 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-13 15:19:18,480 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-13 15:19:18,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:19:18,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:18,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-13 15:19:18,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:18,600 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-13 15:19:18,648 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-13 15:19:18,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:18,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:18,662 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-13 15:19:18,665 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-13 15:19:18,678 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:18,679 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-13 15:19:18,804 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-13 15:19:18,808 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-13 15:19:18,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:18,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-07-13 15:19:18,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:18,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:18,817 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 44 treesize of output 43 [2022-07-13 15:19:18,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:18,821 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-13 15:19:18,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:18,828 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:18,828 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-13 15:19:19,119 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:19:19,120 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-13 15:19:19,125 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:19,125 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-13 15:19:19,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, 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-13 15:19:19,188 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-13 15:19:19,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:19,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:19,321 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-13 15:19:19,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:19,325 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-13 15:19:19,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_56| Int) (v_arrayElimArr_29 (Array Int Int)) (v_arrayElimArr_30 (Array Int 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_29) |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_56| v_arrayElimArr_30) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_29 0))) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_30 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_56|) 0)))) is different from false [2022-07-13 15:19:19,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1070 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_56| Int) (v_arrayElimArr_29 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_29 0))) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_30 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_56|) 0)) (<= (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_29) |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_56| v_arrayElimArr_30) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4))))) is different from false [2022-07-13 15:19:19,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:19,389 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-13 15:19:19,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:19,393 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-13 15:19:19,396 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-13 15:19:19,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:19,400 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-13 15:19:19,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:19,404 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-13 15:19:19,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:19,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:19,534 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-13 15:19:19,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:19,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:19,539 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-13 15:19:19,543 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-13 15:19:19,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399872790] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:19,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:19,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2022-07-13 15:19:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497817816] [2022-07-13 15:19:19,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:19,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 15:19:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 15:19:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=850, Unknown=3, NotChecked=118, Total=1056 [2022-07-13 15:19:19,545 INFO L87 Difference]: Start difference. First operand 119 states and 149 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-13 15:19:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:22,836 INFO L93 Difference]: Finished difference Result 295 states and 345 transitions. [2022-07-13 15:19:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-13 15:19:22,837 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-13 15:19:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:22,838 INFO L225 Difference]: With dead ends: 295 [2022-07-13 15:19:22,838 INFO L226 Difference]: Without dead ends: 293 [2022-07-13 15:19:22,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=703, Invalid=5148, Unknown=9, NotChecked=302, Total=6162 [2022-07-13 15:19:22,840 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 190 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:22,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 470 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 634 Invalid, 0 Unknown, 310 Unchecked, 0.4s Time] [2022-07-13 15:19:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-13 15:19:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 127. [2022-07-13 15:19:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 125 states have (on average 1.28) internal successors, (160), 126 states have internal predecessors, (160), 0 states have call successors, (0), 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-13 15:19:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 160 transitions. [2022-07-13 15:19:22,873 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 160 transitions. Word has length 33 [2022-07-13 15:19:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:22,873 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 160 transitions. [2022-07-13 15:19:22,873 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-13 15:19:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2022-07-13 15:19:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:19:22,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:22,874 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-13 15:19:22,893 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-13 15:19:23,087 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-13 15:19:23,087 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash -250156201, now seen corresponding path program 3 times [2022-07-13 15:19:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:23,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467252227] [2022-07-13 15:19:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:23,380 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-13 15:19:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:23,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467252227] [2022-07-13 15:19:23,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467252227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:23,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133550375] [2022-07-13 15:19:23,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:19:23,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:23,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:23,382 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-13 15:19:23,383 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-13 15:19:23,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 15:19:23,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:23,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-13 15:19:23,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:23,503 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-13 15:19:23,552 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-13 15:19:23,557 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-13 15:19:23,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:23,561 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-13 15:19:23,576 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:23,577 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-13 15:19:23,654 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-13 15:19:23,658 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-13 15:19:23,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:23,664 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-13 15:19:23,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:23,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 15:19:23,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:23,680 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:23,680 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-13 15:19:23,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:23,684 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-13 15:19:23,985 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:19:23,986 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-13 15:19:23,997 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:23,997 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-13 15:19:24,030 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:24,032 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-13 15:19:24,054 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-13 15:19:24,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:24,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:24,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 34 treesize of output 38 [2022-07-13 15:19:24,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:24,174 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-13 15:19:24,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_62| Int) (v_arrayElimArr_37 (Array Int Int)) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1166 4))) (or (<= |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_36) |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_37) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4))) (not (= (select v_arrayElimArr_37 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select v_arrayElimArr_36 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2022-07-13 15:19:24,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:24,258 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-13 15:19:24,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:24,261 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-13 15:19:24,263 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-13 15:19:24,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:24,267 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-13 15:19:24,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:24,270 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-13 15:19:24,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:24,344 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-13 15:19:24,348 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-13 15:19:24,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:24,355 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-13 15:19:24,632 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-13 15:19:24,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133550375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:24,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:24,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 31 [2022-07-13 15:19:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796000500] [2022-07-13 15:19:24,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:24,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 15:19:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 15:19:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=782, Unknown=2, NotChecked=56, Total=930 [2022-07-13 15:19:24,634 INFO L87 Difference]: Start difference. First operand 127 states and 160 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-13 15:19:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:25,929 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2022-07-13 15:19:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:19:25,931 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-13 15:19:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:25,932 INFO L225 Difference]: With dead ends: 153 [2022-07-13 15:19:25,932 INFO L226 Difference]: Without dead ends: 151 [2022-07-13 15:19:25,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=403, Invalid=1853, Unknown=4, NotChecked=92, Total=2352 [2022-07-13 15:19:25,933 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 115 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:25,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 225 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 352 Invalid, 0 Unknown, 115 Unchecked, 0.2s Time] [2022-07-13 15:19:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-13 15:19:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 80. [2022-07-13 15:19:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 79 states have internal predecessors, (97), 0 states have call successors, (0), 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-13 15:19:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2022-07-13 15:19:25,945 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 33 [2022-07-13 15:19:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:25,946 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2022-07-13 15:19:25,946 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-13 15:19:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2022-07-13 15:19:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:19:25,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:25,946 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:25,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-13 15:19:26,159 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-13 15:19:26,159 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1108473179, now seen corresponding path program 3 times [2022-07-13 15:19:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:26,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940308272] [2022-07-13 15:19:26,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:26,532 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-13 15:19:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:26,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940308272] [2022-07-13 15:19:26,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940308272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:26,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101207602] [2022-07-13 15:19:26,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:19:26,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:26,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:26,534 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-13 15:19:26,583 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-13 15:19:26,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 15:19:26,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:26,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-13 15:19:26,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:26,688 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-13 15:19:26,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:26,692 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-13 15:19:26,735 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-13 15:19:26,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:26,739 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-13 15:19:26,749 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:26,749 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-13 15:19:26,757 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-13 15:19:26,825 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-13 15:19:26,829 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-13 15:19:26,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:26,833 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-13 15:19:26,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:26,841 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:26,841 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-13 15:19:26,845 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-13 15:19:26,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:26,849 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-13 15:19:27,259 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:19:27,259 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-13 15:19:27,265 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:27,265 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-13 15:19:27,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 15:19:27,337 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-13 15:19:27,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:27,524 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:27,524 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-13 15:19:27,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:27,528 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-13 15:19:27,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_43 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_67| Int) (v_ArrVal_1262 (Array Int Int)) (v_arrayElimArr_42 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1262 4))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_42 0))) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_43 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_67|) 0)) (< .cse0 |c_ULTIMATE.start_main_~min~0#1|) (<= (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_42) |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_43) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4)) .cse0)))) is different from false [2022-07-13 15:19:27,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:27,583 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-13 15:19:27,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:27,586 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-13 15:19:27,588 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-13 15:19:27,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:27,592 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-13 15:19:27,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:27,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2022-07-13 15:19:27,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:27,691 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-13 15:19:27,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:27,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:27,695 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-13 15:19:27,701 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-13 15:19:27,704 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-13 15:19:27,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101207602] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:27,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:27,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 36 [2022-07-13 15:19:27,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119974211] [2022-07-13 15:19:27,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:27,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 15:19:27,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:27,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 15:19:27,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1088, Unknown=2, NotChecked=66, Total=1260 [2022-07-13 15:19:27,705 INFO L87 Difference]: Start difference. First operand 80 states and 97 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-13 15:19:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:29,661 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2022-07-13 15:19:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 15:19:29,661 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-13 15:19:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:29,661 INFO L225 Difference]: With dead ends: 156 [2022-07-13 15:19:29,661 INFO L226 Difference]: Without dead ends: 154 [2022-07-13 15:19:29,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=481, Invalid=3427, Unknown=2, NotChecked=122, Total=4032 [2022-07-13 15:19:29,662 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 151 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:29,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 216 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 620 Invalid, 0 Unknown, 336 Unchecked, 0.4s Time] [2022-07-13 15:19:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-13 15:19:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 115. [2022-07-13 15:19:29,683 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-13 15:19:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2022-07-13 15:19:29,684 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 35 [2022-07-13 15:19:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:29,684 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2022-07-13 15:19:29,684 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-13 15:19:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2022-07-13 15:19:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:19:29,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:29,685 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-13 15:19:29,703 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-13 15:19:29,894 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-13 15:19:29,894 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:29,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1046433565, now seen corresponding path program 3 times [2022-07-13 15:19:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:29,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491142224] [2022-07-13 15:19:29,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:29,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:30,061 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-13 15:19:30,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:30,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491142224] [2022-07-13 15:19:30,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491142224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:30,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833113399] [2022-07-13 15:19:30,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:19:30,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:30,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:30,064 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-13 15:19:30,065 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-13 15:19:30,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 15:19:30,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:30,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-13 15:19:30,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:30,195 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-13 15:19:30,222 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-13 15:19:30,227 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-13 15:19:30,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:30,231 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-13 15:19:30,244 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:30,244 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-13 15:19:30,317 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-13 15:19:30,322 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-13 15:19:30,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:30,327 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-13 15:19:30,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:30,333 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-13 15:19:30,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:30,341 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:30,342 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-13 15:19:30,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:30,345 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-13 15:19:30,568 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:19:30,568 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-13 15:19:30,574 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:30,575 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-13 15:19:30,597 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-13 15:19:30,599 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-13 15:19:30,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:30,680 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:30,680 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-13 15:19:30,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:30,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-07-13 15:19:30,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_73| Int) (v_arrayElimArr_49 (Array Int Int)) (v_ArrVal_1350 (Array Int Int)) (v_arrayElimArr_50 (Array Int Int))) (or (not (= (select v_arrayElimArr_49 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (<= (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_49) |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_50) |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_50 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_73|) 0)))) is different from false [2022-07-13 15:19:30,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:30,741 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-13 15:19:30,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:30,744 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-13 15:19:30,746 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-13 15:19:30,751 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:30,751 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-13 15:19:30,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:30,761 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-13 15:19:30,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:30,801 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-13 15:19:30,804 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-13 15:19:30,807 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-13 15:19:30,975 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-13 15:19:30,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833113399] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:30,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:30,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 24 [2022-07-13 15:19:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118233189] [2022-07-13 15:19:30,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:30,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 15:19:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:30,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 15:19:30,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=446, Unknown=1, NotChecked=42, Total=552 [2022-07-13 15:19:30,976 INFO L87 Difference]: Start difference. First operand 115 states and 140 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-13 15:19:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:31,670 INFO L93 Difference]: Finished difference Result 246 states and 287 transitions. [2022-07-13 15:19:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:19:31,671 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-13 15:19:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:31,671 INFO L225 Difference]: With dead ends: 246 [2022-07-13 15:19:31,671 INFO L226 Difference]: Without dead ends: 244 [2022-07-13 15:19:31,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=1080, Unknown=2, NotChecked=68, Total=1332 [2022-07-13 15:19:31,672 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 125 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:31,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 267 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 441 Invalid, 0 Unknown, 175 Unchecked, 0.2s Time] [2022-07-13 15:19:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-13 15:19:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 139. [2022-07-13 15:19:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.27007299270073) internal successors, (174), 138 states have internal predecessors, (174), 0 states have call successors, (0), 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-13 15:19:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2022-07-13 15:19:31,703 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 35 [2022-07-13 15:19:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:31,704 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2022-07-13 15:19:31,704 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-13 15:19:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2022-07-13 15:19:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:19:31,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:31,704 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:31,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-13 15:19:31,917 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-13 15:19:31,918 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2065136743, now seen corresponding path program 2 times [2022-07-13 15:19:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:31,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626976185] [2022-07-13 15:19:31,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:31,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:32,142 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-13 15:19:32,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:32,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626976185] [2022-07-13 15:19:32,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626976185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:32,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864774771] [2022-07-13 15:19:32,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:19:32,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:32,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:32,144 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-13 15:19:32,146 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-13 15:19:32,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:19:32,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:32,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-13 15:19:32,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:32,263 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-13 15:19:32,319 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-13 15:19:32,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:32,328 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-13 15:19:32,340 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:32,340 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-13 15:19:32,350 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-13 15:19:32,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-13 15:19:32,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-13 15:19:32,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:32,485 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-13 15:19:32,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:32,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:32,494 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 15:19:32,495 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-13 15:19:32,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:32,498 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-13 15:19:32,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:32,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:32,509 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:32,509 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-13 15:19:32,837 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-13 15:19:32,838 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-13 15:19:32,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:32,844 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:32,844 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-13 15:19:32,898 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-13 15:19:32,898 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-13 15:19:32,911 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-13 15:19:32,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:33,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:33,078 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-13 15:19:33,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:33,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 31 treesize of output 35 [2022-07-13 15:19:33,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_55 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_arrayElimArr_56 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_78| Int)) (let ((.cse0 (select v_ArrVal_1447 4))) (or (<= .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_56 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (<= (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_55) |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_56) |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.base| (select v_arrayElimArr_55 0)))))) is different from false [2022-07-13 15:19:33,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:33,234 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-13 15:19:33,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:33,237 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-13 15:19:33,250 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-13 15:19:33,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:33,256 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-13 15:19:33,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:33,259 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-13 15:19:33,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:33,339 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-13 15:19:33,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:33,348 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-13 15:19:33,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:33,357 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-13 15:19:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-13 15:19:35,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864774771] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:35,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:35,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2022-07-13 15:19:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615337413] [2022-07-13 15:19:35,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:35,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-13 15:19:35,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-13 15:19:35,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1328, Unknown=3, NotChecked=74, Total=1560 [2022-07-13 15:19:35,868 INFO L87 Difference]: Start difference. First operand 139 states and 174 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-13 15:19:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:39,781 INFO L93 Difference]: Finished difference Result 414 states and 471 transitions. [2022-07-13 15:19:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-13 15:19:39,782 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-13 15:19:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:39,783 INFO L225 Difference]: With dead ends: 414 [2022-07-13 15:19:39,783 INFO L226 Difference]: Without dead ends: 412 [2022-07-13 15:19:39,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 53 SyntacticMatches, 12 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 2893 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1447, Invalid=8060, Unknown=3, NotChecked=192, Total=9702 [2022-07-13 15:19:39,785 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 380 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:39,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 576 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 948 Invalid, 0 Unknown, 430 Unchecked, 0.5s Time] [2022-07-13 15:19:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-07-13 15:19:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 154. [2022-07-13 15:19:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 153 states have internal predecessors, (195), 0 states have call successors, (0), 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-13 15:19:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 195 transitions. [2022-07-13 15:19:39,833 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 195 transitions. Word has length 35 [2022-07-13 15:19:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:39,833 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 195 transitions. [2022-07-13 15:19:39,833 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-13 15:19:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 195 transitions. [2022-07-13 15:19:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:19:39,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:39,834 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-13 15:19:39,860 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-13 15:19:40,047 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-13 15:19:40,047 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2033777433, now seen corresponding path program 4 times [2022-07-13 15:19:40,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:40,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453152045] [2022-07-13 15:19:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:40,299 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-13 15:19:40,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:40,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453152045] [2022-07-13 15:19:40,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453152045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836667651] [2022-07-13 15:19:40,300 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:19:40,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:40,302 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-13 15:19:40,303 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-13 15:19:40,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:19:40,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:40,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-13 15:19:40,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:40,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 6 treesize of output 5 [2022-07-13 15:19:40,479 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-13 15:19:40,485 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-13 15:19:40,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:40,490 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-13 15:19:40,504 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:40,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-13 15:19:40,585 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-13 15:19:40,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:40,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 43 treesize of output 37 [2022-07-13 15:19:40,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:40,598 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-13 15:19:40,611 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-13 15:19:40,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:40,622 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:40,623 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-13 15:19:40,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:40,628 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-13 15:19:40,983 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:19:40,983 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-13 15:19:40,990 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:40,990 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-13 15:19:41,034 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:41,034 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-13 15:19:41,048 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-13 15:19:41,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:41,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:41,231 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-13 15:19:41,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:41,235 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-13 15:19:41,248 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_arrayElimArr_62 (Array Int Int)) (v_arrayElimArr_61 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1534 4))) (or (<= (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_61) |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_62) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4)) .cse0) (not (= (select v_arrayElimArr_61 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_83|) 0)) (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (not (= (select v_arrayElimArr_62 0) |c_ULTIMATE.start_main_~l~0#1.offset|))))) is different from false [2022-07-13 15:19:41,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:41,315 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-13 15:19:41,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:41,319 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-13 15:19:41,322 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-13 15:19:41,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:41,327 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-13 15:19:41,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:41,330 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-13 15:19:41,406 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:41,406 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-13 15:19:41,410 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 32 treesize of output 28 [2022-07-13 15:19:41,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:41,418 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 63 treesize of output 55 [2022-07-13 15:19:42,187 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-13 15:19:42,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836667651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:42,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:42,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 32 [2022-07-13 15:19:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368146932] [2022-07-13 15:19:42,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:42,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 15:19:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 15:19:42,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=834, Unknown=1, NotChecked=58, Total=992 [2022-07-13 15:19:42,189 INFO L87 Difference]: Start difference. First operand 154 states and 195 transitions. Second operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 32 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-13 15:19:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:44,030 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2022-07-13 15:19:44,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 15:19:44,030 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 32 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-13 15:19:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:44,031 INFO L225 Difference]: With dead ends: 312 [2022-07-13 15:19:44,031 INFO L226 Difference]: Without dead ends: 310 [2022-07-13 15:19:44,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=426, Invalid=2546, Unknown=2, NotChecked=106, Total=3080 [2022-07-13 15:19:44,032 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 203 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:44,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 410 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 746 Invalid, 0 Unknown, 221 Unchecked, 0.4s Time] [2022-07-13 15:19:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-13 15:19:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 147. [2022-07-13 15:19:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 145 states have (on average 1.2758620689655173) internal successors, (185), 146 states have internal predecessors, (185), 0 states have call successors, (0), 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-13 15:19:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 185 transitions. [2022-07-13 15:19:44,081 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 185 transitions. Word has length 35 [2022-07-13 15:19:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:44,081 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 185 transitions. [2022-07-13 15:19:44,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 32 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-13 15:19:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 185 transitions. [2022-07-13 15:19:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:19:44,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:44,082 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-13 15:19:44,106 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-13 15:19:44,286 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-13 15:19:44,287 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:44,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash -678933349, now seen corresponding path program 5 times [2022-07-13 15:19:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:44,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580019367] [2022-07-13 15:19:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:44,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580019367] [2022-07-13 15:19:44,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580019367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:44,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574431329] [2022-07-13 15:19:44,571 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 15:19:44,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:44,582 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-13 15:19:44,584 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-13 15:19:44,755 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 15:19:44,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:44,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-13 15:19:44,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:44,765 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-13 15:19:44,805 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-13 15:19:44,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,809 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-13 15:19:44,822 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:44,823 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-13 15:19:44,826 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-13 15:19:44,907 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-13 15:19:44,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,912 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-13 15:19:44,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,916 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-13 15:19:44,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,920 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-13 15:19:44,924 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-13 15:19:44,937 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:19:44,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 15:19:45,401 INFO L356 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2022-07-13 15:19:45,401 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 98 treesize of output 52 [2022-07-13 15:19:45,408 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:45,409 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 38 treesize of output 28 [2022-07-13 15:19:45,469 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 34 treesize of output 10 [2022-07-13 15:19:45,495 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-13 15:19:45,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:45,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:45,792 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-13 15:19:45,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:45,796 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-13 15:19:45,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_66 (Array Int Int)) (v_arrayElimArr_67 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.offset_88| Int) (|v_ULTIMATE.start_main_~l~0#1.base_88| Int)) (let ((.cse0 (select v_ArrVal_1631 (+ |v_ULTIMATE.start_main_~l~0#1.offset_88| 4)))) (or (< .cse0 |c_ULTIMATE.start_main_~min~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_88|) 0)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_66 |v_ULTIMATE.start_main_~l~0#1.offset_88|))) (not (= (select v_arrayElimArr_67 |v_ULTIMATE.start_main_~l~0#1.offset_88|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_88| v_ArrVal_1631) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_88| v_arrayElimArr_66) |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_88| v_arrayElimArr_67) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) .cse0)))) is different from false [2022-07-13 15:19:45,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:45,856 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-13 15:19:45,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:45,860 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 59 treesize of output 47 [2022-07-13 15:19:45,862 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-13 15:19:45,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:45,866 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-13 15:19:45,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:45,869 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 32 treesize of output 24 [2022-07-13 15:19:45,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-13 15:19:45,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:45,968 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 175 treesize of output 172 [2022-07-13 15:19:45,971 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 75 treesize of output 67 [2022-07-13 15:19:45,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:45,978 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 149 treesize of output 109 [2022-07-13 15:19:46,099 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-13 15:19:46,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574431329] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:46,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:46,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 40 [2022-07-13 15:19:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766754879] [2022-07-13 15:19:46,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:46,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-13 15:19:46,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:46,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-13 15:19:46,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1364, Unknown=4, NotChecked=74, Total=1560 [2022-07-13 15:19:46,101 INFO L87 Difference]: Start difference. First operand 147 states and 185 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-13 15:19:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:56,235 INFO L93 Difference]: Finished difference Result 692 states and 778 transitions. [2022-07-13 15:19:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-07-13 15:19:56,235 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-13 15:19:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:56,237 INFO L225 Difference]: With dead ends: 692 [2022-07-13 15:19:56,237 INFO L226 Difference]: Without dead ends: 690 [2022-07-13 15:19:56,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 167 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9027 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2785, Invalid=25263, Unknown=12, NotChecked=332, Total=28392 [2022-07-13 15:19:56,239 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 523 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 755 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:56,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 859 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2518 Invalid, 0 Unknown, 755 Unchecked, 1.4s Time] [2022-07-13 15:19:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-07-13 15:19:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 157. [2022-07-13 15:19:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.303225806451613) internal successors, (202), 156 states have internal predecessors, (202), 0 states have call successors, (0), 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-13 15:19:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2022-07-13 15:19:56,280 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 35 [2022-07-13 15:19:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:56,280 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2022-07-13 15:19:56,281 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-13 15:19:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2022-07-13 15:19:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:19:56,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:56,281 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-13 15:19:56,298 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-13 15:19:56,481 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-13 15:19:56,482 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1235648681, now seen corresponding path program 6 times [2022-07-13 15:19:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:56,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341368288] [2022-07-13 15:19:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 15:19:56,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:56,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341368288] [2022-07-13 15:19:56,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341368288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:56,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213447377] [2022-07-13 15:19:56,542 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 15:19:56,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:56,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:56,543 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-13 15:19:56,544 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-13 15:19:56,661 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-13 15:19:56,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:56,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 15:19:56,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:56,669 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-13 15:19:56,696 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-13 15:19:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 15:19:56,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:56,728 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-13 15:19:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 15:19:56,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213447377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:56,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:56,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-07-13 15:19:56,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243158598] [2022-07-13 15:19:56,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:56,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 15:19:56,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:56,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 15:19:56,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-13 15:19:56,761 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:56,953 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2022-07-13 15:19:56,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:19:56,954 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-13 15:19:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:56,954 INFO L225 Difference]: With dead ends: 312 [2022-07-13 15:19:56,954 INFO L226 Difference]: Without dead ends: 231 [2022-07-13 15:19:56,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2022-07-13 15:19:56,955 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 82 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:56,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 104 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:19:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-13 15:19:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 138. [2022-07-13 15:19:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 137 states have internal predecessors, (171), 0 states have call successors, (0), 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-13 15:19:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2022-07-13 15:19:56,994 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 35 [2022-07-13 15:19:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:56,994 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2022-07-13 15:19:56,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2022-07-13 15:19:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:19:56,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:56,995 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:57,011 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-13 15:19:57,203 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-13 15:19:57,203 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:57,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1370374873, now seen corresponding path program 2 times [2022-07-13 15:19:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:57,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746414933] [2022-07-13 15:19:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:57,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:57,365 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-13 15:19:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:57,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746414933] [2022-07-13 15:19:57,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746414933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:57,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138385936] [2022-07-13 15:19:57,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:19:57,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:57,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:57,368 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-13 15:19:57,369 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-13 15:19:57,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:19:57,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:57,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-13 15:19:57,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:57,508 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-13 15:19:57,571 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-13 15:19:57,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:19:57,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:57,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 15:19:57,588 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:19:57,589 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-13 15:19:57,654 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-13 15:19:57,657 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-13 15:19:57,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:57,660 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-13 15:19:57,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:57,664 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-13 15:19:57,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:57,667 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-13 15:19:57,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:57,674 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:19:57,675 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-13 15:19:57,886 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:19:57,886 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-13 15:19:57,891 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:57,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 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-13 15:19:57,914 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-13 15:19:57,915 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-13 15:19:57,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:57,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:57,952 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-13 15:19:57,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:57,955 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-13 15:19:57,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_95| Int) (v_ArrVal_1798 (Array Int Int)) (v_arrayElimArr_73 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int))) (or (not (= (select v_arrayElimArr_73 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_95| v_ArrVal_1798) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_95| v_arrayElimArr_72) |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_95| v_arrayElimArr_73) |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 v_arrayElimArr_72 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_95|) 0)))) is different from false [2022-07-13 15:19:58,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:58,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 58 [2022-07-13 15:19:58,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:58,013 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 55 treesize of output 43 [2022-07-13 15:19:58,014 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 58 treesize of output 46 [2022-07-13 15:19:58,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:58,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-13 15:19:58,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:58,020 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 28 treesize of output 20 [2022-07-13 15:19:58,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_329 Int) (|v_ULTIMATE.start_main_~l~0#1.base_95| Int) (v_ArrVal_1798 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (or (not (= (select (store |c_#valid| v_arrayElimCell_329 1) |v_ULTIMATE.start_main_~l~0#1.base_95|) 0)) (<= (select (select (store (store |c_#memory_int| v_arrayElimCell_329 v_ArrVal_1791) |v_ULTIMATE.start_main_~l~0#1.base_95| v_ArrVal_1798) |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_arrayElimCell_329) 0)))) is different from false [2022-07-13 15:19:58,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:58,066 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-13 15:19:58,069 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-13 15:19:58,072 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-13 15:19:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-13 15:19:58,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138385936] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:58,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:58,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 27 [2022-07-13 15:19:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444163061] [2022-07-13 15:19:58,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:58,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 15:19:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 15:19:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=532, Unknown=6, NotChecked=94, Total=702 [2022-07-13 15:19:58,248 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 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-13 15:20:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:00,137 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2022-07-13 15:20:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 15:20:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 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-13 15:20:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:00,138 INFO L225 Difference]: With dead ends: 214 [2022-07-13 15:20:00,138 INFO L226 Difference]: Without dead ends: 212 [2022-07-13 15:20:00,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=610, Invalid=2691, Unknown=13, NotChecked=226, Total=3540 [2022-07-13 15:20:00,139 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 79 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:00,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 154 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 400 Invalid, 0 Unknown, 187 Unchecked, 0.2s Time] [2022-07-13 15:20:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-13 15:20:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 118. [2022-07-13 15:20:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 117 states have internal predecessors, (143), 0 states have call successors, (0), 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-13 15:20:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 143 transitions. [2022-07-13 15:20:00,176 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 143 transitions. Word has length 35 [2022-07-13 15:20:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:00,176 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 143 transitions. [2022-07-13 15:20:00,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 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-13 15:20:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2022-07-13 15:20:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:20:00,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:00,177 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-13 15:20:00,193 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-13 15:20:00,387 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-13 15:20:00,387 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash -874986469, now seen corresponding path program 7 times [2022-07-13 15:20:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:00,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723173323] [2022-07-13 15:20:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:00,638 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-13 15:20:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723173323] [2022-07-13 15:20:00,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723173323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:00,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435518602] [2022-07-13 15:20:00,639 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 15:20:00,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:00,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:00,640 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-13 15:20:00,640 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-13 15:20:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:00,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 15:20:00,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:00,776 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-13 15:20:00,836 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-13 15:20:00,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:00,839 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-13 15:20:00,850 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:20:00,850 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-13 15:20:00,853 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-13 15:20:00,912 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-13 15:20:00,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:00,916 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-13 15:20:00,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:00,919 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-13 15:20:00,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:00,922 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-13 15:20:00,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:00,929 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:20:00,929 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-13 15:20:00,932 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-13 15:20:01,265 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:20:01,265 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 88 treesize of output 50 [2022-07-13 15:20:01,271 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:20:01,271 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 36 treesize of output 26 [2022-07-13 15:20:01,312 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-13 15:20:01,332 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-13 15:20:01,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:01,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:01,542 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-13 15:20:01,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:01,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 31 treesize of output 35 [2022-07-13 15:20:01,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_77 (Array Int Int)) (v_arrayElimArr_78 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_100| Int) (v_ArrVal_1890 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1890 4))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_77 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_100|) 0)) (<= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_100| v_ArrVal_1890) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_100| v_arrayElimArr_77) |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_100| v_arrayElimArr_78) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) 4)) .cse0) (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_78 0)))))) is different from false [2022-07-13 15:20:01,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:01,614 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-13 15:20:01,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:01,617 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-13 15:20:01,620 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-13 15:20:01,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:01,627 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-13 15:20:01,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:01,630 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-13 15:20:01,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_353 Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_100| Int) (v_ArrVal_1890 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1890 4))) (or (<= .cse0 |c_ULTIMATE.start_main_#t~mem8#1|) (not (= (select (store |c_#valid| v_arrayElimCell_353 1) |v_ULTIMATE.start_main_~l~0#1.base_100|) 0)) (<= (select (select (store (store |c_#memory_int| v_arrayElimCell_353 v_ArrVal_1883) |v_ULTIMATE.start_main_~l~0#1.base_100| v_ArrVal_1890) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) .cse0) (not (= (select |c_#valid| v_arrayElimCell_353) 0))))) is different from false [2022-07-13 15:20:01,702 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:01,702 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-13 15:20:01,705 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 32 treesize of output 28 [2022-07-13 15:20:01,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:01,711 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 63 treesize of output 55 [2022-07-13 15:20:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-13 15:20:02,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435518602] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:02,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:02,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 37 [2022-07-13 15:20:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380963729] [2022-07-13 15:20:02,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:02,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 15:20:02,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:02,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 15:20:02,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1084, Unknown=6, NotChecked=134, Total=1332 [2022-07-13 15:20:02,032 INFO L87 Difference]: Start difference. First operand 118 states and 143 transitions. Second operand has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 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-13 15:20:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:22,389 INFO L93 Difference]: Finished difference Result 197 states and 227 transitions. [2022-07-13 15:20:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-13 15:20:22,389 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 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-13 15:20:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:22,390 INFO L225 Difference]: With dead ends: 197 [2022-07-13 15:20:22,390 INFO L226 Difference]: Without dead ends: 195 [2022-07-13 15:20:22,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=1092, Invalid=4307, Unknown=11, NotChecked=290, Total=5700 [2022-07-13 15:20:22,391 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 206 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:22,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 223 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 623 Invalid, 0 Unknown, 323 Unchecked, 0.4s Time] [2022-07-13 15:20:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-13 15:20:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 70. [2022-07-13 15:20:22,408 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-13 15:20:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-07-13 15:20:22,408 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 35 [2022-07-13 15:20:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:22,408 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-07-13 15:20:22,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 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-13 15:20:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-07-13 15:20:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 15:20:22,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:22,408 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:20:22,425 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-13 15:20:22,609 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-13 15:20:22,609 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1475182485, now seen corresponding path program 4 times [2022-07-13 15:20:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:22,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290078145] [2022-07-13 15:20:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:22,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:22,753 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-13 15:20:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:22,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290078145] [2022-07-13 15:20:22,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290078145] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:22,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181613831] [2022-07-13 15:20:22,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:20:22,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:22,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:22,755 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-13 15:20:22,755 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-13 15:20:22,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:20:22,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:20:22,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-13 15:20:22,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:22,903 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-13 15:20:22,906 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-13 15:20:22,909 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-13 15:20:22,947 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-13 15:20:22,950 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-13 15:20:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:22,953 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-13 15:20:22,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:22,959 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-13 15:20:22,970 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:20:22,970 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-13 15:20:23,036 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-13 15:20:23,039 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-13 15:20:23,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:23,047 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:20:23,048 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-13 15:20:23,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:23,061 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-13 15:20:23,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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-13 15:20:23,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:23,064 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-13 15:20:23,364 INFO L356 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-07-13 15:20:23,365 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-13 15:20:23,376 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:20:23,376 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-13 15:20:23,379 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-13 15:20:23,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:23,446 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-07-13 15:20:23,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,450 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-13 15:20:23,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,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 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-13 15:20:23,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,462 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-13 15:20:23,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_106| Int) (v_ArrVal_1986 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_106| (store v_ArrVal_1986 0 |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_106| (store v_ArrVal_1989 0 |c_ULTIMATE.start_main_~l~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_106|) 0)))) is different from false [2022-07-13 15:20:23,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,488 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-13 15:20:23,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,491 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-13 15:20:23,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,498 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-13 15:20:23,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,501 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-13 15:20:23,524 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,525 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-13 15:20:23,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,528 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-13 15:20:23,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,549 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-13 15:20:23,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,553 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-13 15:20:23,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,591 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-13 15:20:23,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,595 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-13 15:20:23,602 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,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 33 treesize of output 34 [2022-07-13 15:20:23,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,605 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-13 15:20:23,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,629 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-13 15:20:23,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,632 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-13 15:20:23,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,639 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-13 15:20:23,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,642 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-13 15:20:23,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,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 1 case distinctions, treesize of input 51 treesize of output 52 [2022-07-13 15:20:23,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,694 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 45 treesize of output 49 [2022-07-13 15:20:23,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,698 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-13 15:20:23,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,702 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-13 15:20:23,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,713 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 51 treesize of output 52 [2022-07-13 15:20:23,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,717 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 45 treesize of output 49 [2022-07-13 15:20:23,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2022-07-13 15:20:23,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,724 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-13 15:20:23,831 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_109 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_106| Int) (v_arrayElimArr_110 (Array Int Int)) (v_arrayElimArr_112 (Array Int Int)) (v_arrayElimArr_111 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_112 0))) (or (not (= (select v_arrayElimArr_109 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select v_arrayElimArr_111 0) 0)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_110 0))) (not (= (select |c_#valid| .cse0) 0)) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_109) |v_ULTIMATE.start_main_~l~0#1.base_106| v_arrayElimArr_111))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_110) |v_ULTIMATE.start_main_~l~0#1.base_106| v_arrayElimArr_112) .cse0) 0)) (select (select .cse1 .cse0) 0))) 0) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_106|) 0))))) (forall ((|v_ULTIMATE.start_main_~l~0#1.base_106| Int) (v_arrayElimArr_108 (Array Int Int)) (v_arrayElimArr_107 (Array Int Int)) (v_arrayElimArr_106 (Array Int Int)) (v_arrayElimArr_105 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_107 0))) (or (not (= (select |c_#valid| .cse2) 0)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_105 0))) (not (= (select (store |c_#valid| .cse2 1) |v_ULTIMATE.start_main_~l~0#1.base_106|) 0)) (= (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_105) |v_ULTIMATE.start_main_~l~0#1.base_106| v_arrayElimArr_107))) (select .cse3 (select (select .cse3 .cse2) 0))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_arrayElimArr_106) |v_ULTIMATE.start_main_~l~0#1.base_106| v_arrayElimArr_108) .cse2) 0)) 0) (not (= (select v_arrayElimArr_106 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select v_arrayElimArr_108 0) 0)))))) is different from false [2022-07-13 15:20:23,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,952 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-13 15:20:23,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:23,956 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-13 15:20:23,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:23,960 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-13 15:20:23,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:23,978 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 188 treesize of output 166 [2022-07-13 15:20:23,982 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 155 [2022-07-13 15:20:23,984 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 115 [2022-07-13 15:20:23,993 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:20:23,993 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-13 15:20:24,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:24,002 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-13 15:20:24,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:24,010 INFO L356 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-07-13 15:20:24,010 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 256 treesize of output 222 [2022-07-13 15:20:24,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:24,017 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 214 treesize of output 152 [2022-07-13 15:20:24,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:24,022 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 80 treesize of output 74 [2022-07-13 15:20:24,025 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 99 treesize of output 83 [2022-07-13 15:20:24,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2022-07-13 15:20:24,034 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:20:24,034 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 24 treesize of output 26 [2022-07-13 15:20:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-07-13 15:20:24,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181613831] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:24,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:24,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 21 [2022-07-13 15:20:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710753544] [2022-07-13 15:20:24,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:24,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 15:20:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:24,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 15:20:24,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=300, Unknown=2, NotChecked=70, Total=420 [2022-07-13 15:20:24,041 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-13 15:20:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:24,410 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-07-13 15:20:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:20:24,410 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-13 15:20:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:24,411 INFO L225 Difference]: With dead ends: 113 [2022-07-13 15:20:24,411 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 15:20:24,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=479, Unknown=2, NotChecked=90, Total=650 [2022-07-13 15:20:24,412 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:24,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 250 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-07-13 15:20:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 15:20:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-13 15:20:24,431 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-13 15:20:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-07-13 15:20:24,431 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 38 [2022-07-13 15:20:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:24,431 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-07-13 15:20:24,431 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-13 15:20:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-07-13 15:20:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 15:20:24,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:24,432 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:20:24,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-13 15:20:24,649 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-13 15:20:24,649 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash -901782222, now seen corresponding path program 5 times [2022-07-13 15:20:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:24,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902223960] [2022-07-13 15:20:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:24,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:20:25,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:25,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902223960] [2022-07-13 15:20:25,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902223960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:25,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101229107] [2022-07-13 15:20:25,116 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 15:20:25,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:25,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:25,124 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-13 15:20:25,125 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-13 15:20:25,635 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-13 15:20:25,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:20:25,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-13 15:20:25,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:25,648 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-13 15:20:25,703 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-13 15:20:25,707 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-13 15:20:25,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,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, 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-13 15:20:25,723 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:20:25,723 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-13 15:20:25,791 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-13 15:20:25,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,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 43 treesize of output 37 [2022-07-13 15:20:25,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,801 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-13 15:20:25,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,805 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-13 15:20:25,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,828 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:20:25,828 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-13 15:20:25,832 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-13 15:20:25,934 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-13 15:20:25,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,944 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:20:25,945 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-13 15:20:25,949 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-13 15:20:25,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,953 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-13 15:20:25,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,962 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:20:25,962 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-13 15:20:25,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:25,967 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-13 15:20:26,403 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-13 15:20:26,403 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-13 15:20:26,413 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:20:26,414 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-13 15:20:26,438 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-13 15:20:26,440 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-13 15:20:26,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:26,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:26,488 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-13 15:20:26,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:26,491 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-13 15:20:26,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_121 (Array Int Int)) (v_arrayElimArr_120 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_113| Int) (v_ArrVal_2111 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_113|) 0)) (not (= (select v_arrayElimArr_120 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_113| v_arrayElimArr_121)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_113| 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_113| v_ArrVal_2111) (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2)))))) (not (= (select v_arrayElimArr_121 0) |c_ULTIMATE.start_main_~l~0#1.offset|)))) is different from false [2022-07-13 15:20:26,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:26,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 135 treesize of output 129 [2022-07-13 15:20:26,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:26,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 120 treesize of output 114 [2022-07-13 15:20:26,569 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_121 (Array Int Int)) (v_arrayElimArr_120 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_113| Int) (v_ArrVal_2104 (Array Int Int)) (v_arrayElimArr_123 (Array Int Int)) (v_ArrVal_2111 (Array Int Int)) (v_arrayElimArr_122 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_120 0)) (.cse1 (select v_arrayElimArr_121 0))) (or (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_113|) 0)) (not (= (select v_arrayElimArr_122 .cse1) |c_ULTIMATE.start_main_~l~0#1.base|)) (<= |c_ULTIMATE.start_main_~min~0#1| (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_123) |v_ULTIMATE.start_main_~l~0#1.base_113| v_arrayElimArr_121)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_122) |v_ULTIMATE.start_main_~l~0#1.base_113| v_arrayElimArr_120))) (let ((.cse3 (select (select .cse2 .cse0) .cse1)) (.cse4 (select (select .cse5 .cse0) .cse1))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2104) |v_ULTIMATE.start_main_~l~0#1.base_113| v_ArrVal_2111) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4))))) (not (= (select |c_#valid| .cse0) 0)) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_123 .cse1))) (not (= .cse1 0))))) is different from false [2022-07-13 15:20:26,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:26,639 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 232 treesize of output 189 [2022-07-13 15:20:26,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:26,644 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 172 treesize of output 129 [2022-07-13 15:20:26,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:26,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:26,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:26,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:26,654 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 97 treesize of output 61 [2022-07-13 15:20:26,656 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 116 treesize of output 92 [2022-07-13 15:20:26,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2022-07-13 15:20:26,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:26,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:26,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:26,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-13 15:20:26,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2104 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_113| Int) (v_ArrVal_2111 (Array Int Int)) (v_ArrVal_2098 (Array Int Int)) (v_arrayElimCell_425 Int) (v_arrayElimCell_424 Int)) (let ((.cse0 (store |c_#valid| v_arrayElimCell_424 1))) (or (not (= (select |c_#valid| v_arrayElimCell_424) 0)) (<= |c_ULTIMATE.start_main_#t~mem6#1| (select (select (store (store (store |c_#memory_int| v_arrayElimCell_424 v_ArrVal_2098) v_arrayElimCell_425 v_ArrVal_2104) |v_ULTIMATE.start_main_~l~0#1.base_113| v_ArrVal_2111) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (not (= (select (store .cse0 v_arrayElimCell_425 1) |v_ULTIMATE.start_main_~l~0#1.base_113|) 0)) (not (= (select .cse0 v_arrayElimCell_425) 0))))) is different from false [2022-07-13 15:20:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2022-07-13 15:20:26,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101229107] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:26,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:26,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 32 [2022-07-13 15:20:26,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112741637] [2022-07-13 15:20:26,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:26,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 15:20:26,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:26,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 15:20:26,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=742, Unknown=5, NotChecked=168, Total=992 [2022-07-13 15:20:26,741 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 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-13 15:20:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:30,486 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2022-07-13 15:20:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-13 15:20:30,486 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 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) Word has length 43 [2022-07-13 15:20:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:30,487 INFO L225 Difference]: With dead ends: 224 [2022-07-13 15:20:30,487 INFO L226 Difference]: Without dead ends: 222 [2022-07-13 15:20:30,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=725, Invalid=3697, Unknown=12, NotChecked=396, Total=4830 [2022-07-13 15:20:30,488 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 160 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:30,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 415 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 720 Invalid, 0 Unknown, 297 Unchecked, 0.5s Time] [2022-07-13 15:20:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-13 15:20:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 137. [2022-07-13 15:20:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 136 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-13 15:20:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2022-07-13 15:20:30,536 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 43 [2022-07-13 15:20:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:30,537 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2022-07-13 15:20:30,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 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-13 15:20:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2022-07-13 15:20:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 15:20:30,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:30,537 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:20:30,573 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-13 15:20:30,751 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-13 15:20:30,751 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -767768716, now seen corresponding path program 4 times [2022-07-13 15:20:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:30,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975164886] [2022-07-13 15:20:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:31,038 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-13 15:20:31,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:31,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975164886] [2022-07-13 15:20:31,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975164886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:31,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211868755] [2022-07-13 15:20:31,039 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:20:31,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:31,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:31,048 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-13 15:20:31,052 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-13 15:20:31,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:20:31,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:20:31,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-13 15:20:31,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:31,216 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-13 15:20:31,279 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-13 15:20:31,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,282 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-13 15:20:31,296 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:20:31,296 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-13 15:20:31,303 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-13 15:20:31,367 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-13 15:20:31,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,371 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-13 15:20:31,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,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, 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-13 15:20:31,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,387 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:20:31,387 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-13 15:20:31,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,390 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-13 15:20:31,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:20:31,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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-13 15:20:31,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,506 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:20:31,506 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-13 15:20:31,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,511 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-13 15:20:31,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,517 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-13 15:20:31,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 8 treesize of output 7 [2022-07-13 15:20:31,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:31,531 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:20:31,531 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-13 15:20:32,017 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-13 15:20:32,017 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 156 treesize of output 90 [2022-07-13 15:20:32,028 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:20:32,028 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-13 15:20:32,065 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:20:32,066 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-13 15:20:32,079 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-13 15:20:32,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:32,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:32,292 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-13 15:20:32,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:32,295 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-13 15:20:32,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2236 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_120| Int) (v_arrayElimArr_129 (Array Int Int)) (v_arrayElimArr_128 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2236 4))) (or (not (= (select v_arrayElimArr_129 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_120| v_arrayElimArr_129)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_120| v_arrayElimArr_128))) (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_120| v_ArrVal_2236) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_120|) 0)) (not (= (select v_arrayElimArr_128 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2022-07-13 15:20:32,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:32,353 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-13 15:20:32,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:32,358 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-13 15:20:32,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:32,508 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-13 15:20:32,514 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:32,515 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-13 15:20:32,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:32,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:32,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:32,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:32,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:32,521 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-13 15:20:32,524 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-13 15:20:32,527 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-13 15:20:32,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:32,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:32,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:32,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:32,531 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-13 15:20:32,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2236 (Array Int Int)) (v_ArrVal_2222 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_120| Int) (v_arrayElimCell_458 Int) (v_arrayElimCell_459 Int)) (let ((.cse0 (select v_ArrVal_2236 4)) (.cse1 (store |c_#valid| v_arrayElimCell_458 1))) (or (<= |c_ULTIMATE.start_main_#t~mem6#1| .cse0) (not (= (select (store .cse1 v_arrayElimCell_459 1) |v_ULTIMATE.start_main_~l~0#1.base_120|) 0)) (<= .cse0 (select (select (store (store (store |c_#memory_int| v_arrayElimCell_458 v_ArrVal_2222) v_arrayElimCell_459 v_ArrVal_2228) |v_ULTIMATE.start_main_~l~0#1.base_120| v_ArrVal_2236) |c_ULTIMATE.start_main_~l~0#1.base|) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (not (= (select .cse1 v_arrayElimCell_459) 0)) (not (= (select |c_#valid| v_arrayElimCell_458) 0))))) is different from false [2022-07-13 15:20:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-07-13 15:20:32,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211868755] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:32,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:32,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 38 [2022-07-13 15:20:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399312533] [2022-07-13 15:20:32,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:32,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 15:20:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 15:20:32,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1155, Unknown=5, NotChecked=138, Total=1406 [2022-07-13 15:20:32,634 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 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-13 15:20:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:35,744 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2022-07-13 15:20:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 15:20:35,744 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 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-13 15:20:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:35,745 INFO L225 Difference]: With dead ends: 167 [2022-07-13 15:20:35,745 INFO L226 Difference]: Without dead ends: 165 [2022-07-13 15:20:35,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=671, Invalid=3110, Unknown=9, NotChecked=242, Total=4032 [2022-07-13 15:20:35,746 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 224 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:35,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 381 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 598 Invalid, 0 Unknown, 235 Unchecked, 0.4s Time] [2022-07-13 15:20:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-13 15:20:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 90. [2022-07-13 15:20:35,769 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-13 15:20:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-07-13 15:20:35,769 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 43 [2022-07-13 15:20:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:35,769 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-07-13 15:20:35,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.1578947368421053) internal successors, (120), 38 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-13 15:20:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-07-13 15:20:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:20:35,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:35,770 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:20:35,787 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-13 15:20:35,970 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-13 15:20:35,971 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash 970804020, now seen corresponding path program 4 times [2022-07-13 15:20:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:35,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837359630] [2022-07-13 15:20:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:36,269 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-13 15:20:36,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:36,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837359630] [2022-07-13 15:20:36,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837359630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:36,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886529459] [2022-07-13 15:20:36,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:20:36,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:36,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:36,271 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-13 15:20:36,272 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-13 15:20:36,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:20:36,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:20:36,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-13 15:20:36,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:20:36,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:20:36,463 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-13 15:20:36,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,466 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-13 15:20:36,476 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:20:36,477 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-13 15:20:36,542 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-13 15:20:36,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,547 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-13 15:20:36,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,552 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-13 15:20:36,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,555 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-13 15:20:36,559 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-13 15:20:36,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,574 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:20:36,574 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-13 15:20:36,685 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-13 15:20:36,690 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-13 15:20:36,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,700 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:20:36,700 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-13 15:20:36,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,705 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-13 15:20:36,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,714 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:20:36,714 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-13 15:20:36,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:36,719 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-13 15:20:37,129 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-13 15:20:37,129 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-13 15:20:37,139 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:20:37,140 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-13 15:20:37,159 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-13 15:20:37,161 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-13 15:20:37,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:37,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:37,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70 [2022-07-13 15:20:37,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:37,290 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-13 15:20:37,299 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_127| Int) (v_ArrVal_2365 (Array Int Int)) (v_arrayElimArr_138 (Array Int Int)) (v_arrayElimArr_137 (Array Int Int))) (or (not (= (select v_arrayElimArr_138 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_137 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_127|) 0)) (<= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_127| v_arrayElimArr_138)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_127| v_arrayElimArr_137))) (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_127| v_ArrVal_2365) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~max~0#1|))) is different from false [2022-07-13 15:20:37,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:37,346 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 135 treesize of output 129 [2022-07-13 15:20:37,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:37,352 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 120 treesize of output 114 [2022-07-13 15:20:37,370 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2359 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_127| Int) (v_arrayElimArr_140 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_arrayElimArr_139 (Array Int Int)) (v_arrayElimArr_138 (Array Int Int)) (v_arrayElimArr_137 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_138 0)) (.cse0 (select v_arrayElimArr_137 0))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= .cse1 0)) (<= (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_140) |v_ULTIMATE.start_main_~l~0#1.base_127| v_arrayElimArr_138)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_139) |v_ULTIMATE.start_main_~l~0#1.base_127| v_arrayElimArr_137))) (let ((.cse3 (select (select .cse2 .cse0) .cse1)) (.cse4 (select (select .cse5 .cse0) .cse1))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_2359) |v_ULTIMATE.start_main_~l~0#1.base_127| v_ArrVal_2365) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)))) |c_ULTIMATE.start_main_~max~0#1|) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_139 .cse1))) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_140 .cse1))) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_127|) 0))))) is different from false [2022-07-13 15:20:37,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:37,455 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 232 treesize of output 189 [2022-07-13 15:20:37,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:37,460 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 172 treesize of output 129 [2022-07-13 15:20:37,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:37,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:37,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:37,466 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 97 treesize of output 61 [2022-07-13 15:20:37,468 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 116 treesize of output 92 [2022-07-13 15:20:37,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2022-07-13 15:20:37,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:37,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:37,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:37,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-13 15:20:37,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:37,535 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 176 treesize of output 137 [2022-07-13 15:20:37,539 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 122 treesize of output 114 [2022-07-13 15:20:37,542 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 114 treesize of output 98 [2022-07-13 15:20:37,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-13 15:20:37,989 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-13 15:20:37,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886529459] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:37,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:37,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 32 [2022-07-13 15:20:37,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5161956] [2022-07-13 15:20:37,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:37,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 15:20:37,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:37,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 15:20:37,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=789, Unknown=2, NotChecked=114, Total=992 [2022-07-13 15:20:37,991 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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-13 15:20:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:39,792 INFO L93 Difference]: Finished difference Result 233 states and 269 transitions. [2022-07-13 15:20:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 15:20:39,793 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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-13 15:20:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:39,794 INFO L225 Difference]: With dead ends: 233 [2022-07-13 15:20:39,794 INFO L226 Difference]: Without dead ends: 231 [2022-07-13 15:20:39,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=335, Invalid=2637, Unknown=6, NotChecked=214, Total=3192 [2022-07-13 15:20:39,794 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 161 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:39,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 351 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 836 Invalid, 0 Unknown, 264 Unchecked, 0.4s Time] [2022-07-13 15:20:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-13 15:20:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 170. [2022-07-13 15:20:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.2261904761904763) internal successors, (206), 169 states have internal predecessors, (206), 0 states have call successors, (0), 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-13 15:20:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 206 transitions. [2022-07-13 15:20:39,870 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 206 transitions. Word has length 45 [2022-07-13 15:20:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:39,870 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 206 transitions. [2022-07-13 15:20:39,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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-13 15:20:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 206 transitions. [2022-07-13 15:20:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:20:39,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:39,871 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-13 15:20:39,888 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-13 15:20:40,083 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-13 15:20:40,083 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:40,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1499184312, now seen corresponding path program 8 times [2022-07-13 15:20:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:40,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761674205] [2022-07-13 15:20:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:40,161 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-13 15:20:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:40,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761674205] [2022-07-13 15:20:40,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761674205] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:40,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924316234] [2022-07-13 15:20:40,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:20:40,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:40,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:40,163 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-13 15:20:40,164 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-13 15:20:40,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:20:40,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:20:40,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:20:40,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:40,352 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-13 15:20:40,375 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-13 15:20:40,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 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2022-07-13 15:20:40,393 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-13 15:20:40,405 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-13 15:20:40,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:40,446 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-13 15:20:40,448 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-13 15:20:40,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924316234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:40,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:40,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-07-13 15:20:40,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558814113] [2022-07-13 15:20:40,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:40,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 15:20:40,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:40,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 15:20:40,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:20:40,450 INFO L87 Difference]: Start difference. First operand 170 states and 206 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-13 15:20:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:40,734 INFO L93 Difference]: Finished difference Result 386 states and 441 transitions. [2022-07-13 15:20:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:20:40,734 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-13 15:20:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:40,735 INFO L225 Difference]: With dead ends: 386 [2022-07-13 15:20:40,735 INFO L226 Difference]: Without dead ends: 309 [2022-07-13 15:20:40,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-07-13 15:20:40,735 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 109 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:40,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 113 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:20:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-13 15:20:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 151. [2022-07-13 15:20:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 149 states have (on average 1.221476510067114) internal successors, (182), 150 states have internal predecessors, (182), 0 states have call successors, (0), 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-13 15:20:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 182 transitions. [2022-07-13 15:20:40,800 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 182 transitions. Word has length 45 [2022-07-13 15:20:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:40,800 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 182 transitions. [2022-07-13 15:20:40,800 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-13 15:20:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 182 transitions. [2022-07-13 15:20:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:20:40,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:40,801 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:20:40,817 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-13 15:20:41,007 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-13 15:20:41,007 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1538950708, now seen corresponding path program 3 times [2022-07-13 15:20:41,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:41,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976378431] [2022-07-13 15:20:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:41,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:20:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:41,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976378431] [2022-07-13 15:20:41,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976378431] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:41,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907442726] [2022-07-13 15:20:41,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:20:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:41,596 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-13 15:20:41,597 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-13 15:20:41,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 15:20:41,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:20:41,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-13 15:20:41,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:41,817 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-13 15:20:41,865 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-13 15:20:41,868 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-13 15:20:41,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:41,871 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-13 15:20:41,881 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:20:41,881 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-13 15:20:41,962 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-13 15:20:41,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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-13 15:20:41,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:41,969 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-13 15:20:41,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:41,973 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-13 15:20:41,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:41,986 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:20:41,986 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-13 15:20:41,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:41,990 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-13 15:20:42,099 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-13 15:20:42,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:42,112 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:20:42,112 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-13 15:20:42,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:42,118 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-13 15:20:42,121 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-13 15:20:42,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:42,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:42,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:42,126 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-13 15:20:42,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:42,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:42,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:42,136 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:20:42,136 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-13 15:20:42,776 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-13 15:20:42,776 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 172 treesize of output 94 [2022-07-13 15:20:42,787 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:20:42,787 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-13 15:20:42,842 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-13 15:20:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:20:42,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:43,081 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:43,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 74 treesize of output 72 [2022-07-13 15:20:43,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:43,085 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-13 15:20:43,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_147 (Array Int Int)) (v_ArrVal_2597 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_140| Int) (v_arrayElimArr_148 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2597 4))) (or (not (= (select v_arrayElimArr_148 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_140|) 0)) (not (= (select v_arrayElimArr_147 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (< .cse0 |c_ULTIMATE.start_main_~min~0#1|) (<= (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_140| v_arrayElimArr_148)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_140| v_arrayElimArr_147))) (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_140| v_ArrVal_2597) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))) .cse0)))) is different from false [2022-07-13 15:20:43,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:43,145 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-13 15:20:43,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:43,149 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-13 15:20:43,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:43,325 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-13 15:20:43,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:43,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 115 [2022-07-13 15:20:43,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:43,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:43,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:43,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:43,337 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-13 15:20:43,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:43,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 334 [2022-07-13 15:20:43,346 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 367 treesize of output 309 [2022-07-13 15:20:43,349 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 303 treesize of output 251 [2022-07-13 15:20:53,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:53,089 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 617 treesize of output 602 [2022-07-13 15:20:53,096 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 582 treesize of output 550 [2022-07-13 15:20:53,102 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 550 treesize of output 534 [2022-07-13 15:20:53,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:53,112 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 539 treesize of output 419 [2022-07-13 15:20:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-13 15:20:54,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907442726] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:54,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:54,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 14] total 43 [2022-07-13 15:20:54,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987423826] [2022-07-13 15:20:54,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:54,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-13 15:20:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-13 15:20:54,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1604, Unknown=1, NotChecked=80, Total=1806 [2022-07-13 15:20:54,050 INFO L87 Difference]: Start difference. First operand 151 states and 182 transitions. Second operand has 43 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 43 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-13 15:21:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:21:02,291 INFO L93 Difference]: Finished difference Result 613 states and 710 transitions. [2022-07-13 15:21:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-07-13 15:21:02,295 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 43 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) Word has length 45 [2022-07-13 15:21:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:21:02,296 INFO L225 Difference]: With dead ends: 613 [2022-07-13 15:21:02,296 INFO L226 Difference]: Without dead ends: 611 [2022-07-13 15:21:02,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4199 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1242, Invalid=12792, Unknown=12, NotChecked=234, Total=14280 [2022-07-13 15:21:02,297 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 401 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:21:02,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 814 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1949 Invalid, 0 Unknown, 728 Unchecked, 1.1s Time] [2022-07-13 15:21:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-07-13 15:21:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 249. [2022-07-13 15:21:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 247 states have (on average 1.311740890688259) internal successors, (324), 248 states have internal predecessors, (324), 0 states have call successors, (0), 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-13 15:21:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 324 transitions. [2022-07-13 15:21:02,450 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 324 transitions. Word has length 45 [2022-07-13 15:21:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:21:02,450 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 324 transitions. [2022-07-13 15:21:02,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.9302325581395348) internal successors, (126), 43 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-13 15:21:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 324 transitions. [2022-07-13 15:21:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:21:02,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:21:02,451 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-13 15:21:02,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-13 15:21:02,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-13 15:21:02,652 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:21:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:21:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1503826700, now seen corresponding path program 9 times [2022-07-13 15:21:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:21:02,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802822248] [2022-07-13 15:21:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:21:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:21:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:21:03,098 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-13 15:21:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:21:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802822248] [2022-07-13 15:21:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802822248] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:21:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002278591] [2022-07-13 15:21:03,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:21:03,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:21:03,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:21:03,100 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:21:03,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-13 15:21:03,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 15:21:03,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:21:03,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-13 15:21:03,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:21:03,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:21:03,355 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-13 15:21:03,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,359 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-13 15:21:03,370 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:21:03,370 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-13 15:21:03,373 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-13 15:21:03,457 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-13 15:21:03,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,461 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-13 15:21:03,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,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, 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-13 15:21:03,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,476 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-13 15:21:03,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,488 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:21:03,488 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-13 15:21:03,493 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-13 15:21:03,609 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-13 15:21:03,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,619 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:21:03,619 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-13 15:21:03,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,623 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-13 15:21:03,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,628 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-13 15:21:03,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:03,636 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:21:03,636 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-13 15:21:03,639 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-13 15:21:05,275 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-13 15:21:05,275 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 260 treesize of output 134 [2022-07-13 15:21:05,288 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:21:05,289 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 88 treesize of output 52 [2022-07-13 15:21:05,354 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-13 15:21:05,357 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-13 15:21:05,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:21:05,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:05,705 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 134 treesize of output 125 [2022-07-13 15:21:05,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:05,711 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 119 treesize of output 110 [2022-07-13 15:21:05,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_147| Int) (v_arrayElimArr_156 (Array Int Int)) (v_arrayElimArr_155 (Array Int Int)) (v_ArrVal_2727 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_147| v_arrayElimArr_156)) (.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_147| v_arrayElimArr_155))) (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_147| v_ArrVal_2727)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse3) (+ .cse4 4)))) (or (not (= (select v_arrayElimArr_156 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select v_arrayElimArr_155 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_147|) 0)) (< .cse0 |c_ULTIMATE.start_main_~min~0#1|) (<= (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4)) .cse0)))))) is different from false [2022-07-13 15:21:05,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:05,780 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 215 treesize of output 206 [2022-07-13 15:21:05,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:05,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 200 treesize of output 191 [2022-07-13 15:21:05,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2720 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_147| Int) (v_arrayElimArr_158 (Array Int Int)) (v_arrayElimArr_157 (Array Int Int)) (v_arrayElimArr_156 (Array Int Int)) (v_arrayElimArr_155 (Array Int Int)) (v_ArrVal_2727 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_155 0))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse1 v_arrayElimArr_158) |v_ULTIMATE.start_main_~l~0#1.base_147| v_arrayElimArr_156)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_157) |v_ULTIMATE.start_main_~l~0#1.base_147| v_arrayElimArr_155))) (let ((.cse2 (store (store |c_#memory_int| .cse1 v_ArrVal_2720) |v_ULTIMATE.start_main_~l~0#1.base_147| v_ArrVal_2727)) (.cse4 (select (select .cse3 .cse1) 0)) (.cse5 (select (select .cse6 .cse1) 0))) (let ((.cse0 (select (select .cse2 .cse4) (+ .cse5 4)))) (or (not (= (select v_arrayElimArr_156 0) 0)) (< .cse0 |c_ULTIMATE.start_main_~min~0#1|) (not (= (select (store |c_#valid| .cse1 1) |v_ULTIMATE.start_main_~l~0#1.base_147|) 0)) (<= (select (select .cse2 (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4)) .cse0) (not (= (select v_arrayElimArr_157 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_158 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0)))))))) is different from false [2022-07-13 15:21:05,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:05,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 282 [2022-07-13 15:21:05,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:05,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:05,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:05,905 INFO L356 Elim1Store]: treesize reduction 34, result has 10.5 percent of original size [2022-07-13 15:21:05,905 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 226 treesize of output 188 [2022-07-13 15:21:05,908 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 217 treesize of output 183 [2022-07-13 15:21:05,910 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 177 treesize of output 153 [2022-07-13 15:21:05,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:05,915 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 132 treesize of output 102 [2022-07-13 15:21:05,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:05,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:05,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:05,919 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 72 treesize of output 60 [2022-07-13 15:21:05,923 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 56 [2022-07-13 15:21:06,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:06,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:06,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:06,034 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-13 15:21:06,038 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 254 [2022-07-13 15:21:06,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 238 [2022-07-13 15:21:06,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:06,059 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 243 treesize of output 211 [2022-07-13 15:21:06,690 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-13 15:21:06,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002278591] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:21:06,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:21:06,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 44 [2022-07-13 15:21:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588898428] [2022-07-13 15:21:06,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:21:06,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 15:21:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:21:06,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 15:21:06,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1606, Unknown=3, NotChecked=162, Total=1892 [2022-07-13 15:21:06,692 INFO L87 Difference]: Start difference. First operand 249 states and 324 transitions. Second operand has 44 states, 44 states have (on average 2.7954545454545454) internal successors, (123), 44 states have internal predecessors, (123), 0 states have call successors, (0), 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-13 15:21:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:21:18,140 INFO L93 Difference]: Finished difference Result 657 states and 770 transitions. [2022-07-13 15:21:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-07-13 15:21:18,141 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.7954545454545454) internal successors, (123), 44 states have internal predecessors, (123), 0 states have call successors, (0), 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-13 15:21:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:21:18,142 INFO L225 Difference]: With dead ends: 657 [2022-07-13 15:21:18,142 INFO L226 Difference]: Without dead ends: 655 [2022-07-13 15:21:18,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 124 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3925 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=867, Invalid=14378, Unknown=15, NotChecked=490, Total=15750 [2022-07-13 15:21:18,144 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 284 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 3471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 800 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:21:18,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 869 Invalid, 3471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2572 Invalid, 0 Unknown, 800 Unchecked, 1.4s Time] [2022-07-13 15:21:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-07-13 15:21:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 316. [2022-07-13 15:21:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 314 states have (on average 1.3280254777070064) internal successors, (417), 315 states have internal predecessors, (417), 0 states have call successors, (0), 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-13 15:21:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 417 transitions. [2022-07-13 15:21:18,342 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 417 transitions. Word has length 45 [2022-07-13 15:21:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:21:18,342 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 417 transitions. [2022-07-13 15:21:18,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.7954545454545454) internal successors, (123), 44 states have internal predecessors, (123), 0 states have call successors, (0), 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-13 15:21:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 417 transitions. [2022-07-13 15:21:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:21:18,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:21:18,343 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-13 15:21:18,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-13 15:21:18,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-13 15:21:18,559 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:21:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:21:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2071413068, now seen corresponding path program 10 times [2022-07-13 15:21:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:21:18,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152541742] [2022-07-13 15:21:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:21:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:21:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:21:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 9 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:21:19,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:21:19,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152541742] [2022-07-13 15:21:19,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152541742] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:21:19,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385477802] [2022-07-13 15:21:19,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:21:19,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:21:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:21:19,178 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:21:19,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-13 15:21:19,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:21:19,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:21:19,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-13 15:21:19,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:21:19,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:21:19,436 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-13 15:21:19,439 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-13 15:21:19,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,442 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-13 15:21:19,454 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:21:19,454 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-13 15:21:19,625 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-13 15:21:19,628 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-13 15:21:19,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,633 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-13 15:21:19,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,640 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 15:21:19,640 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-13 15:21:19,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,654 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:21:19,654 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-13 15:21:19,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,658 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-13 15:21:19,768 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-13 15:21:19,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-13 15:21:19,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,784 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:21:19,784 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 102 treesize of output 78 [2022-07-13 15:21:19,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,791 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-07-13 15:21:19,792 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 53 treesize of output 48 [2022-07-13 15:21:19,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,802 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:21:19,802 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-13 15:21:19,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:19,806 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-13 15:21:20,424 INFO L356 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2022-07-13 15:21:20,424 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 159 treesize of output 93 [2022-07-13 15:21:20,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:20,437 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:21:20,437 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-13 15:21:20,511 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-13 15:21:20,511 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-13 15:21:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:21:20,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:21:20,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:20,679 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-13 15:21:20,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:20,683 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-13 15:21:20,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_165 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_154| Int) (v_arrayElimArr_166 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2851 4))) (or (<= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_154| v_arrayElimArr_166)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_154| v_arrayElimArr_165))) (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_154| v_ArrVal_2851) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) .cse4) (<= .cse4 |c_ULTIMATE.start_main_~max~0#1|) (not (= (select v_arrayElimArr_166 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_154|) 0)) (not (= (select v_arrayElimArr_165 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2022-07-13 15:21:20,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:20,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 1 case distinctions, treesize of input 137 treesize of output 131 [2022-07-13 15:21:20,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:20,747 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 122 treesize of output 116 [2022-07-13 15:21:21,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:21,074 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 210 treesize of output 175 [2022-07-13 15:21:21,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:21,080 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 162 treesize of output 127 [2022-07-13 15:21:21,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:21,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:21,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:21,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:21,086 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 95 treesize of output 63 [2022-07-13 15:21:21,089 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 114 treesize of output 90 [2022-07-13 15:21:21,092 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-13 15:21:21,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:21,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:21,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:21,097 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 37 treesize of output 25 [2022-07-13 15:21:21,188 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:21,188 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 1233 treesize of output 1194 [2022-07-13 15:21:21,196 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 1174 treesize of output 1110 [2022-07-13 15:21:21,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:21,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 1117 treesize of output 869 [2022-07-13 15:21:21,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:21,221 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 864 treesize of output 838 [2022-07-13 15:21:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 41 refuted. 1 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-13 15:21:25,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385477802] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:21:25,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:21:25,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 44 [2022-07-13 15:21:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518185252] [2022-07-13 15:21:25,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:21:25,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 15:21:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:21:25,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 15:21:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1642, Unknown=7, NotChecked=82, Total=1892 [2022-07-13 15:21:25,778 INFO L87 Difference]: Start difference. First operand 316 states and 417 transitions. Second operand has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 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-13 15:21:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:21:48,147 INFO L93 Difference]: Finished difference Result 983 states and 1147 transitions. [2022-07-13 15:21:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-07-13 15:21:48,148 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 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-13 15:21:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:21:48,152 INFO L225 Difference]: With dead ends: 983 [2022-07-13 15:21:48,152 INFO L226 Difference]: Without dead ends: 981 [2022-07-13 15:21:48,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 80 SyntacticMatches, 43 SemanticMatches, 228 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 21329 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=6034, Invalid=46142, Unknown=40, NotChecked=454, Total=52670 [2022-07-13 15:21:48,155 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 489 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 3694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1426 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:21:48,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 656 Invalid, 3694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 2071 Invalid, 0 Unknown, 1426 Unchecked, 1.4s Time] [2022-07-13 15:21:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-13 15:21:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 405. [2022-07-13 15:21:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 403 states have (on average 1.3598014888337469) internal successors, (548), 404 states have internal predecessors, (548), 0 states have call successors, (0), 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-13 15:21:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 548 transitions. [2022-07-13 15:21:48,436 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 548 transitions. Word has length 45 [2022-07-13 15:21:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:21:48,436 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 548 transitions. [2022-07-13 15:21:48,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 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-13 15:21:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 548 transitions. [2022-07-13 15:21:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:21:48,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:21:48,437 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 15:21:48,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-13 15:21:48,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-13 15:21:48,642 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:21:48,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:21:48,643 INFO L85 PathProgramCache]: Analyzing trace with hash -901085710, now seen corresponding path program 11 times [2022-07-13 15:21:48,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:21:48,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889888049] [2022-07-13 15:21:48,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:21:48,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:21:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:21:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:21:48,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:21:48,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889888049] [2022-07-13 15:21:48,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889888049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:21:48,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798117091] [2022-07-13 15:21:48,998 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 15:21:48,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:21:48,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:21:49,000 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:21:49,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-13 15:21:49,302 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-13 15:21:49,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:21:49,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-13 15:21:49,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:21:49,318 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-13 15:21:49,388 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-13 15:21:49,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,392 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-13 15:21:49,412 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:21:49,412 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-13 15:21:49,421 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-13 15:21:49,498 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-13 15:21:49,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,504 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-13 15:21:49,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,509 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-13 15:21:49,526 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-13 15:21:49,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,543 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:21:49,543 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-13 15:21:49,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,548 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-13 15:21:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-13 15:21:49,784 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-13 15:21:49,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,793 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 15:21:49,793 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-13 15:21:49,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,800 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-13 15:21:49,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:49,821 INFO L356 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2022-07-13 15:21:49,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2022-07-13 15:21:49,831 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:21:49,832 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 87 treesize of output 67 [2022-07-13 15:21:50,357 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-13 15:21:50,357 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 167 treesize of output 97 [2022-07-13 15:21:50,370 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:21:50,370 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-13 15:21:50,421 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:21:50,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-07-13 15:21:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:21:50,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:21:50,624 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:50,625 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-13 15:21:50,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:50,629 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-13 15:21:50,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_176 (Array Int Int)) (v_arrayElimArr_175 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_161| Int)) (or (not (= (select v_arrayElimArr_176 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_161|) 0)) (<= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_161| v_arrayElimArr_176)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_161| v_arrayElimArr_175))) (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_161| v_ArrVal_2974) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~max~0#1|) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_175 0))))) is different from false [2022-07-13 15:21:50,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:50,809 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 141 treesize of output 135 [2022-07-13 15:21:50,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:50,815 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 126 treesize of output 120 [2022-07-13 15:21:50,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2966 (Array Int Int)) (v_arrayElimArr_176 (Array Int Int)) (v_arrayElimArr_175 (Array Int Int)) (v_ArrVal_2974 (Array Int Int)) (v_arrayElimArr_178 (Array Int Int)) (v_arrayElimArr_177 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_161| Int)) (let ((.cse1 (select v_arrayElimArr_176 0))) (let ((.cse0 (select v_ArrVal_2966 (+ .cse1 4))) (.cse2 (select v_arrayElimArr_175 0))) (or (<= .cse0 |c_ULTIMATE.start_main_~max~0#1|) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_177 .cse1))) (not (= (select (store |c_#valid| .cse2 1) |v_ULTIMATE.start_main_~l~0#1.base_161|) 0)) (not (= .cse1 0)) (<= (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 v_arrayElimArr_178) |v_ULTIMATE.start_main_~l~0#1.base_161| v_arrayElimArr_176)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_177) |v_ULTIMATE.start_main_~l~0#1.base_161| v_arrayElimArr_175))) (let ((.cse4 (select (select .cse3 .cse2) .cse1)) (.cse5 (select (select .cse6 .cse2) .cse1))) (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_2966) |v_ULTIMATE.start_main_~l~0#1.base_161| v_ArrVal_2974) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4)))) .cse0) (not (= (select v_arrayElimArr_178 .cse1) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0)))))) is different from false [2022-07-13 15:21:50,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:50,946 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 238 treesize of output 195 [2022-07-13 15:21:50,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:50,955 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 178 treesize of output 135 [2022-07-13 15:21:50,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:50,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:50,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:50,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:50,963 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 103 treesize of output 67 [2022-07-13 15:21:50,985 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 122 treesize of output 98 [2022-07-13 15:21:50,991 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 80 treesize of output 68 [2022-07-13 15:21:50,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:50,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:50,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:50,996 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 45 treesize of output 29 [2022-07-13 15:21:51,000 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 48 treesize of output 40 [2022-07-13 15:21:51,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:51,082 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-13 15:21:51,088 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 254 [2022-07-13 15:21:51,093 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 254 treesize of output 246 [2022-07-13 15:21:51,103 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:51,104 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 251 treesize of output 211 [2022-07-13 15:21:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 37 refuted. 1 times theorem prover too weak. 0 trivial. 19 not checked. [2022-07-13 15:21:52,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798117091] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:21:52,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:21:52,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 41 [2022-07-13 15:21:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561544093] [2022-07-13 15:21:52,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:21:52,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 15:21:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:21:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 15:21:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1345, Unknown=5, NotChecked=150, Total=1640 [2022-07-13 15:21:52,037 INFO L87 Difference]: Start difference. First operand 405 states and 548 transitions. Second operand has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 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-13 15:21:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:21:55,834 INFO L93 Difference]: Finished difference Result 699 states and 860 transitions. [2022-07-13 15:21:55,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-13 15:21:55,834 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 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) Word has length 45 [2022-07-13 15:21:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:21:55,835 INFO L225 Difference]: With dead ends: 699 [2022-07-13 15:21:55,836 INFO L226 Difference]: Without dead ends: 697 [2022-07-13 15:21:55,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 69 SyntacticMatches, 11 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=678, Invalid=5173, Unknown=9, NotChecked=302, Total=6162 [2022-07-13 15:21:55,836 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 284 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 676 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:21:55,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 783 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1592 Invalid, 0 Unknown, 676 Unchecked, 0.8s Time] [2022-07-13 15:21:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-07-13 15:21:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 428. [2022-07-13 15:21:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 426 states have (on average 1.363849765258216) internal successors, (581), 427 states have internal predecessors, (581), 0 states have call successors, (0), 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-13 15:21:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 581 transitions. [2022-07-13 15:21:56,110 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 581 transitions. Word has length 45 [2022-07-13 15:21:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:21:56,111 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 581 transitions. [2022-07-13 15:21:56,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 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-13 15:21:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 581 transitions. [2022-07-13 15:21:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:21:56,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:21:56,112 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 15:21:56,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-13 15:21:56,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-13 15:21:56,330 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:21:56,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:21:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash -20429070, now seen corresponding path program 12 times [2022-07-13 15:21:56,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:21:56,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387767888] [2022-07-13 15:21:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:21:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:21:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:21:56,630 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-13 15:21:56,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:21:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387767888] [2022-07-13 15:21:56,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387767888] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:21:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141969407] [2022-07-13 15:21:56,631 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 15:21:56,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:21:56,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:21:56,632 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:21:56,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-13 15:21:56,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-13 15:21:56,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:21:56,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-13 15:21:56,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:21:56,851 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-13 15:21:56,914 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-13 15:21:56,918 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-13 15:21:56,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:56,921 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-13 15:21:56,933 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:21:56,934 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-13 15:21:57,003 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-13 15:21:57,007 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-13 15:21:57,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,010 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-13 15:21:57,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,014 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-13 15:21:57,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,027 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:21:57,027 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-13 15:21:57,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,031 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-13 15:21:57,137 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-13 15:21:57,141 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-13 15:21:57,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,153 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:21:57,153 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-13 15:21:57,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,158 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-13 15:21:57,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,169 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:21:57,170 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-13 15:21:57,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:57,175 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-13 15:21:57,713 INFO L356 Elim1Store]: treesize reduction 77, result has 19.8 percent of original size [2022-07-13 15:21:57,713 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 156 treesize of output 90 [2022-07-13 15:21:57,724 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:21:57,724 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-13 15:21:57,775 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:21:57,775 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-13 15:21:57,789 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-13 15:21:57,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:21:58,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:58,022 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-13 15:21:58,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:58,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 63 [2022-07-13 15:21:58,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_186 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_168| Int) (v_arrayElimArr_185 (Array Int Int)) (v_ArrVal_3104 (Array Int Int))) (let ((.cse4 (select v_ArrVal_3104 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_168|) 0)) (<= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_168| v_arrayElimArr_186)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_168| v_arrayElimArr_185))) (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_168| v_ArrVal_3104) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) .cse4) (<= .cse4 |c_ULTIMATE.start_main_~max~0#1|) (not (= (select v_arrayElimArr_186 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select v_arrayElimArr_185 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2022-07-13 15:21:58,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:58,086 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 137 treesize of output 131 [2022-07-13 15:21:58,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:58,091 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 122 treesize of output 116 [2022-07-13 15:21:58,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:58,262 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 210 treesize of output 175 [2022-07-13 15:21:58,268 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:58,268 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 162 treesize of output 127 [2022-07-13 15:21:58,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:58,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:58,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:58,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:58,275 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 95 treesize of output 63 [2022-07-13 15:21:58,279 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 114 treesize of output 90 [2022-07-13 15:21:58,282 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-13 15:21:58,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:58,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:58,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:58,286 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 37 treesize of output 25 [2022-07-13 15:21:58,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:58,364 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 155 treesize of output 158 [2022-07-13 15:21:58,367 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 138 treesize of output 130 [2022-07-13 15:21:58,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:58,375 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 135 treesize of output 111 [2022-07-13 15:21:58,379 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 50 treesize of output 46 [2022-07-13 15:21:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-13 15:21:59,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141969407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:21:59,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:21:59,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 42 [2022-07-13 15:21:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267879979] [2022-07-13 15:21:59,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:21:59,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 15:21:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:21:59,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 15:21:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1501, Unknown=6, NotChecked=78, Total=1722 [2022-07-13 15:21:59,043 INFO L87 Difference]: Start difference. First operand 428 states and 581 transitions. Second operand has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 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-13 15:22:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:22:01,734 INFO L93 Difference]: Finished difference Result 821 states and 1045 transitions. [2022-07-13 15:22:01,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 15:22:01,734 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 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) Word has length 45 [2022-07-13 15:22:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:22:01,736 INFO L225 Difference]: With dead ends: 821 [2022-07-13 15:22:01,736 INFO L226 Difference]: Without dead ends: 819 [2022-07-13 15:22:01,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=414, Invalid=4552, Unknown=8, NotChecked=138, Total=5112 [2022-07-13 15:22:01,737 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 189 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:22:01,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 834 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1229 Invalid, 0 Unknown, 422 Unchecked, 0.6s Time] [2022-07-13 15:22:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-07-13 15:22:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 505. [2022-07-13 15:22:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 503 states have (on average 1.389662027833002) internal successors, (699), 504 states have internal predecessors, (699), 0 states have call successors, (0), 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-13 15:22:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 699 transitions. [2022-07-13 15:22:02,075 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 699 transitions. Word has length 45 [2022-07-13 15:22:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:22:02,075 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 699 transitions. [2022-07-13 15:22:02,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 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-13 15:22:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 699 transitions. [2022-07-13 15:22:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:22:02,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:22:02,076 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-13 15:22:02,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-13 15:22:02,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-13 15:22:02,287 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:22:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:22:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash -310665804, now seen corresponding path program 13 times [2022-07-13 15:22:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:22:02,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996186681] [2022-07-13 15:22:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:22:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:22:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:22:02,707 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-13 15:22:02,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:22:02,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996186681] [2022-07-13 15:22:02,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996186681] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:22:02,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771801575] [2022-07-13 15:22:02,708 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 15:22:02,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:22:02,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:22:02,712 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:22:02,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-13 15:22:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:22:02,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-13 15:22:02,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:22:02,939 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-13 15:22:02,996 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-13 15:22:02,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:02,999 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-13 15:22:03,010 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-13 15:22:03,011 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-13 15:22:03,013 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-13 15:22:03,078 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-13 15:22:03,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,082 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-13 15:22:03,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,086 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-13 15:22:03,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,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, 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-13 15:22:03,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,101 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-13 15:22:03,102 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-13 15:22:03,105 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-13 15:22:03,300 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-13 15:22:03,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,312 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-13 15:22:03,312 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 104 treesize of output 76 [2022-07-13 15:22:03,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,317 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 59 treesize of output 58 [2022-07-13 15:22:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,322 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 62 treesize of output 67 [2022-07-13 15:22:03,326 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-13 15:22:03,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:03,334 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:22:03,334 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-13 15:22:10,076 INFO L356 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2022-07-13 15:22:10,076 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 190 treesize of output 100 [2022-07-13 15:22:10,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:10,088 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-13 15:22:10,088 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-13 15:22:10,168 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:22:10,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2022-07-13 15:22:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:22:10,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:22:10,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,326 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-13 15:22:10,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,330 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-13 15:22:10,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_194 (Array Int Int)) (v_arrayElimArr_193 (Array Int Int)) (v_ArrVal_3231 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_175| Int)) (let ((.cse4 (select v_ArrVal_3231 4))) (or (<= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_175| v_arrayElimArr_194)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_175| v_arrayElimArr_193))) (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_175| v_ArrVal_3231) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) .cse4) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_175|) 0)) (not (= (select v_arrayElimArr_193 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (<= .cse4 |c_ULTIMATE.start_main_~max~0#1|) (not (= (select v_arrayElimArr_194 0) |c_ULTIMATE.start_main_~l~0#1.offset|))))) is different from false [2022-07-13 15:22:10,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,511 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 137 treesize of output 131 [2022-07-13 15:22:10,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,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 122 treesize of output 116 [2022-07-13 15:22:10,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,727 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 210 treesize of output 175 [2022-07-13 15:22:10,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 127 [2022-07-13 15:22:10,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:22:10,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:22:10,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:22:10,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:22:10,739 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 95 treesize of output 63 [2022-07-13 15:22: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 114 treesize of output 90 [2022-07-13 15:22:10,745 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-13 15:22:10,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:22:10,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:22:10,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:22:10,750 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 37 treesize of output 25 [2022-07-13 15:22:10,753 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 35 treesize of output 27 [2022-07-13 15:22:10,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,849 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 2465 treesize of output 2378 [2022-07-13 15:22:10,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2370 treesize of output 2248 [2022-07-13 15:22:10,886 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 1115 treesize of output 1051 [2022-07-13 15:22:10,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:22:10,902 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 2171 treesize of output 1667 [2022-07-13 15:22:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-13 15:22:32,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771801575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:22:32,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:22:32,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 42 [2022-07-13 15:22:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587101630] [2022-07-13 15:22:32,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:22:32,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 15:22:32,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:22:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 15:22:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1493, Unknown=6, NotChecked=78, Total=1722 [2022-07-13 15:22:32,690 INFO L87 Difference]: Start difference. First operand 505 states and 699 transitions. Second operand has 42 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 42 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)