./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.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 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:37:19,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:37:19,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:37:19,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:37:19,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:37:19,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:37:19,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:37:19,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:37:19,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:37:19,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:37:19,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:37:19,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:37:19,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:37:19,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:37:19,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:37:19,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:37:19,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:37:19,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:37:19,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:37:19,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:37:19,721 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:37:19,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:37:19,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:37:19,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:37:19,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:37:19,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:37:19,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:37:19,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:37:19,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:37:19,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:37:19,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:37:19,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:37:19,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:37:19,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:37:19,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:37:19,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:37:19,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:37:19,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:37:19,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:37:19,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:37:19,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:37:19,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:37:19,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:37:19,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:37:19,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:37:19,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:37:19,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:37:19,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:37:19,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:37:19,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:37:19,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:37:19,757 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:37:19,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:37:19,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:37:19,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:37:19,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:37:19,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:37:19,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:37:19,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:37:19,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:37:19,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:37:19,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:37:19,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:37:19,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:37:19,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:37:19,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:37:19,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:37:19,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:37:19,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:37:19,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:37:19,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:37:19,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:37:19,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:37:19,760 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:37:19,760 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:37:19,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:37:19,761 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2022-07-12 03:37:19,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:37:19,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:37:19,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:37:19,965 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:37:19,967 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:37:19,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2022-07-12 03:37:20,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22c18f94/7269e04dcb224925b8428843c451d4f6/FLAG6a38256ad [2022-07-12 03:37:20,415 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:37:20,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2022-07-12 03:37:20,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22c18f94/7269e04dcb224925b8428843c451d4f6/FLAG6a38256ad [2022-07-12 03:37:20,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22c18f94/7269e04dcb224925b8428843c451d4f6 [2022-07-12 03:37:20,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:37:20,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:37:20,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:37:20,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:37:20,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:37:20,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:37:20" (1/1) ... [2022-07-12 03:37:20,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f07a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:20, skipping insertion in model container [2022-07-12 03:37:20,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:37:20" (1/1) ... [2022-07-12 03:37:20,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:37:20,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:37:21,043 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/cart.i[23713,23726] [2022-07-12 03:37:21,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:37:21,051 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:37:21,075 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/cart.i[23713,23726] [2022-07-12 03:37:21,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:37:21,106 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:37:21,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21 WrapperNode [2022-07-12 03:37:21,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:37:21,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:37:21,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:37:21,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:37:21,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,140 INFO L137 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-07-12 03:37:21,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:37:21,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:37:21,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:37:21,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:37:21,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:37:21,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:37:21,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:37:21,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:37:21,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (1/1) ... [2022-07-12 03:37:21,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:37:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:21,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:37:21,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:37:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:37:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:37:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:37:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:37:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:37:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:37:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:37:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:37:21,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:37:21,294 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:37:21,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:37:21,453 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:37:21,459 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:37:21,459 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 03:37:21,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:37:21 BoogieIcfgContainer [2022-07-12 03:37:21,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:37:21,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:37:21,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:37:21,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:37:21,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:37:20" (1/3) ... [2022-07-12 03:37:21,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75293819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:37:21, skipping insertion in model container [2022-07-12 03:37:21,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:37:21" (2/3) ... [2022-07-12 03:37:21,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75293819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:37:21, skipping insertion in model container [2022-07-12 03:37:21,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:37:21" (3/3) ... [2022-07-12 03:37:21,466 INFO L111 eAbstractionObserver]: Analyzing ICFG cart.i [2022-07-12 03:37:21,476 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:37:21,477 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:37:21,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:37:21,512 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@5d8adce2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@655d2931 [2022-07-12 03:37:21,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:37:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:37:21,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:21,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:21,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2022-07-12 03:37:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:21,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156905809] [2022-07-12 03:37:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:21,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156905809] [2022-07-12 03:37:21,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156905809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:21,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:21,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:37:21,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364100346] [2022-07-12 03:37:21,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:21,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:37:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:21,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:37:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:37:21,670 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:21,685 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2022-07-12 03:37:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:37:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-12 03:37:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:21,692 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:37:21,692 INFO L226 Difference]: Without dead ends: 17 [2022-07-12 03:37:21,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:37:21,697 INFO L413 NwaCegarLoop]: 25 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, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:21,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-12 03:37:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-12 03:37:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-07-12 03:37:21,724 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2022-07-12 03:37:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:21,724 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-07-12 03:37:21,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-07-12 03:37:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:37:21,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:21,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:21,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:37:21,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2022-07-12 03:37:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:21,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334527884] [2022-07-12 03:37:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:21,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:21,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334527884] [2022-07-12 03:37:21,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334527884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:21,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:21,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:37:21,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122046435] [2022-07-12 03:37:21,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:21,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:37:21,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:21,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:37:21,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:37:21,833 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:21,886 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-07-12 03:37:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:37:21,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 03:37:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:21,888 INFO L225 Difference]: With dead ends: 36 [2022-07-12 03:37:21,888 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 03:37:21,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:37:21,893 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:21,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 03:37:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 03:37:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-12 03:37:21,901 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2022-07-12 03:37:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:21,902 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-12 03:37:21,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-07-12 03:37:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:37:21,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:21,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:21,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:37:21,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2022-07-12 03:37:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:21,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840403018] [2022-07-12 03:37:21,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:21,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:21,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840403018] [2022-07-12 03:37:21,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840403018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:21,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:21,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:37:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454633473] [2022-07-12 03:37:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:21,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:37:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:21,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:37:21,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:37:21,992 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:22,024 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-12 03:37:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:37:22,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 03:37:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:22,025 INFO L225 Difference]: With dead ends: 36 [2022-07-12 03:37:22,025 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 03:37:22,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:37:22,026 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:22,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 03:37:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-07-12 03:37:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-07-12 03:37:22,033 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2022-07-12 03:37:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:22,033 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-12 03:37:22,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-07-12 03:37:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:37:22,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:22,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:22,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:37:22,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2022-07-12 03:37:22,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:22,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438002492] [2022-07-12 03:37:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:37:22,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438002492] [2022-07-12 03:37:22,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438002492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:37:22,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:37:22,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:37:22,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666566237] [2022-07-12 03:37:22,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:37:22,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:37:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:22,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:37:22,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:37:22,102 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:22,113 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-12 03:37:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:37:22,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 03:37:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:22,115 INFO L225 Difference]: With dead ends: 37 [2022-07-12 03:37:22,115 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:37:22,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:37:22,116 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:22,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:37:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:37:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-12 03:37:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-12 03:37:22,122 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2022-07-12 03:37:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:22,123 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-12 03:37:22,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-07-12 03:37:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:37:22,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:22,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:22,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:37:22,124 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2022-07-12 03:37:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:22,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219096840] [2022-07-12 03:37:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:22,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:22,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219096840] [2022-07-12 03:37:22,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219096840] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:22,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806990272] [2022-07-12 03:37:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:22,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:22,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:22,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:37:22,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:37:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:22,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 03:37:22,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:22,614 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 29 treesize of output 21 [2022-07-12 03:37:22,656 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:22,657 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 26 treesize of output 10 [2022-07-12 03:37:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:22,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:22,821 INFO L356 Elim1Store]: treesize reduction 30, result has 30.2 percent of original size [2022-07-12 03:37:22,823 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 488 treesize of output 441 [2022-07-12 03:37:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:37:23,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806990272] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:23,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:23,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2022-07-12 03:37:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416928934] [2022-07-12 03:37:23,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:23,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:37:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:23,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:37:23,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:37:23,025 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:23,227 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-07-12 03:37:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:37:23,228 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 03:37:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:23,228 INFO L225 Difference]: With dead ends: 48 [2022-07-12 03:37:23,228 INFO L226 Difference]: Without dead ends: 46 [2022-07-12 03:37:23,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:37:23,229 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 67 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:23,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 125 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 78 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-07-12 03:37:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-12 03:37:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-07-12 03:37:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-07-12 03:37:23,241 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2022-07-12 03:37:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:23,242 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-12 03:37:23,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-07-12 03:37:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:37:23,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:23,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:23,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:23,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:23,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2022-07-12 03:37:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:23,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835877805] [2022-07-12 03:37:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:37:23,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835877805] [2022-07-12 03:37:23,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835877805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937885488] [2022-07-12 03:37:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:23,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:23,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:23,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:37:23,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:37:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:23,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:37:23,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:23,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:37:23,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:37:23,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:37:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:23,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:23,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-12 03:37:23,889 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 03:37:23,890 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 25 treesize of output 24 [2022-07-12 03:37:23,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:23,897 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 19 treesize of output 23 [2022-07-12 03:37:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:37:23,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937885488] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:23,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:23,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2022-07-12 03:37:23,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698543492] [2022-07-12 03:37:23,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:23,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 03:37:23,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:23,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 03:37:23,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:37:23,915 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:24,121 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-07-12 03:37:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:37:24,122 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 03:37:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:24,122 INFO L225 Difference]: With dead ends: 59 [2022-07-12 03:37:24,122 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 03:37:24,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-07-12 03:37:24,123 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:24,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 141 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:37:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 03:37:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-07-12 03:37:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-07-12 03:37:24,128 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2022-07-12 03:37:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:24,128 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-12 03:37:24,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-07-12 03:37:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:37:24,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:24,129 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:24,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 03:37:24,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 03:37:24,344 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2022-07-12 03:37:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:24,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337655597] [2022-07-12 03:37:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:24,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:24,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337655597] [2022-07-12 03:37:24,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337655597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:24,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046143931] [2022-07-12 03:37:24,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:37:24,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:24,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:24,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:37:24,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:37:24,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:37:24,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:37:24,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 03:37:24,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:24,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:37:24,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:37:24,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:37:24,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:37:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:24,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:24,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046143931] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:24,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:24,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-07-12 03:37:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606890840] [2022-07-12 03:37:24,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:24,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:37:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:37:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:37:24,700 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:24,806 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-07-12 03:37:24,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:37:24,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 03:37:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:24,807 INFO L225 Difference]: With dead ends: 67 [2022-07-12 03:37:24,808 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 03:37:24,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:37:24,809 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:24,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:37:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 03:37:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-12 03:37:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-07-12 03:37:24,813 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2022-07-12 03:37:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:24,814 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-07-12 03:37:24,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-07-12 03:37:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:37:24,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:24,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:24,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:25,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:25,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2022-07-12 03:37:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:25,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612494562] [2022-07-12 03:37:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:25,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:25,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612494562] [2022-07-12 03:37:25,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612494562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:25,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175400576] [2022-07-12 03:37:25,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:37:25,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:25,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:25,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:37:25,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:37:25,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 03:37:25,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:37:25,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 03:37:25,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:25,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:37:25,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:37:25,434 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:37:25,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:37:25,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 03:37:25,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-12 03:37:25,512 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 18 [2022-07-12 03:37:25,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:25,534 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 26 treesize of output 10 [2022-07-12 03:37:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:25,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:25,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-12 03:37:25,615 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_379 Int) (v_ArrVal_380 Int) (v_ArrVal_386 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (not (<= v_ArrVal_380 |c_ULTIMATE.start_main_~order~0#1|)) (not (<= (select .cse0 .cse1) v_ArrVal_379)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_380) .cse1 v_ArrVal_379)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)))))))) is different from false [2022-07-12 03:37:25,654 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:37:25,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 57 [2022-07-12 03:37:25,692 INFO L356 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-07-12 03:37:25,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 83 [2022-07-12 03:37:25,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:37:25,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-12 03:37:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 03:37:25,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175400576] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:25,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:25,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-07-12 03:37:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825370013] [2022-07-12 03:37:25,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:25,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 03:37:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:25,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 03:37:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=171, Unknown=2, NotChecked=54, Total=272 [2022-07-12 03:37:25,801 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:26,085 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-07-12 03:37:26,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:37:26,086 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 03:37:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:26,086 INFO L225 Difference]: With dead ends: 61 [2022-07-12 03:37:26,086 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 03:37:26,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=351, Unknown=2, NotChecked=82, Total=552 [2022-07-12 03:37:26,087 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 75 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:26,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 192 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 116 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2022-07-12 03:37:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 03:37:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-07-12 03:37:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-07-12 03:37:26,093 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 28 [2022-07-12 03:37:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:26,093 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-07-12 03:37:26,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-07-12 03:37:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 03:37:26,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:26,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:26,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 03:37:26,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:26,314 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 194884952, now seen corresponding path program 2 times [2022-07-12 03:37:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:26,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872663823] [2022-07-12 03:37:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:26,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:26,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:26,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872663823] [2022-07-12 03:37:26,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872663823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:26,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727014647] [2022-07-12 03:37:26,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:37:26,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:26,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:26,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:37:26,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:37:26,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:37:26,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:37:26,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 03:37:26,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:26,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:37:26,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:37:26,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:37:26,710 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:37:26,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 15 treesize of output 15 [2022-07-12 03:37:26,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:26,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:26,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:26,798 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 27 treesize of output 30 [2022-07-12 03:37:26,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:26,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:26,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:26,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 29 [2022-07-12 03:37:26,924 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:37:26,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 90 [2022-07-12 03:37:26,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:26,932 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 69 treesize of output 41 [2022-07-12 03:37:26,938 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 49 treesize of output 47 [2022-07-12 03:37:27,018 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 47 treesize of output 31 [2022-07-12 03:37:27,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2022-07-12 03:37:27,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:27,038 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 26 treesize of output 10 [2022-07-12 03:37:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:27,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:27,122 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_516 (Array Int Int)) (v_ArrVal_519 Int) (v_ArrVal_517 Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (not (<= (select .cse0 .cse1) v_ArrVal_517)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_519) .cse1 v_ArrVal_517)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (<= (select .cse2 (+ .cse3 8)) (select .cse2 (+ .cse3 4)))) (not (<= v_ArrVal_519 |c_ULTIMATE.start_main_~order~0#1|)))))) is different from false [2022-07-12 03:37:27,152 INFO L356 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2022-07-12 03:37:27,153 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 2075 treesize of output 1770 [2022-07-12 03:37:28,093 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_522 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|)))) (and .cse0 (forall ((v_ArrVal_516 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) .cse1) (= .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_516 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~i~0#1.offset| (+ .cse2 4)) (= .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (or (forall ((v_ArrVal_516 (Array Int Int))) (= (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) .cse0) (forall ((v_ArrVal_516 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|)))) is different from false [2022-07-12 03:37:28,108 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|)) (forall ((v_ArrVal_516 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) .cse0) (= .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_516 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~i~0#1.offset| (+ .cse1 4)) (= .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_516 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|))) is different from false [2022-07-12 03:37:28,144 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_511 Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_508) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_511)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_511 Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int)) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse3 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_508) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_511)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (= .cse1 .cse2) (= (+ .cse1 4) .cse2))))) (forall ((v_ArrVal_511 Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int)) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_508) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_511)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (= .cse4 (+ 4 .cse5)) (= .cse4 .cse5))))) (forall ((v_ArrVal_509 Int) (v_ArrVal_513 Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= .cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse8 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_509) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_513)) .cse7 v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2022-07-12 03:37:28,234 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_511 Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_508) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_511)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~l~0#1.offset|)))) (forall ((v_ArrVal_509 Int) (v_ArrVal_513 Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_509) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_513)) .cse1 v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (forall ((v_ArrVal_511 Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int)) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse5 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_508) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_511)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse3 .cse4) (= (+ .cse3 4) .cse4))))) (forall ((v_ArrVal_511 Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int)) (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse8 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_508) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_511)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse6 (select .cse8 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ .cse6 4) .cse7) (= .cse7 .cse6)))))) is different from false [2022-07-12 03:37:28,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:28,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 47 [2022-07-12 03:37:28,306 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-12 03:37:28,309 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 13 treesize of output 9 [2022-07-12 03:37:28,314 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 03:37:28,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 1 [2022-07-12 03:37:28,322 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 03:37:28,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 03:37:28,326 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 03:37:28,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 1 [2022-07-12 03:37:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 03:37:28,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727014647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:28,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:28,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2022-07-12 03:37:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074356184] [2022-07-12 03:37:28,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:28,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 03:37:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:28,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 03:37:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=362, Unknown=5, NotChecked=210, Total=650 [2022-07-12 03:37:28,346 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:28,855 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-07-12 03:37:28,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:37:28,856 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 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 31 [2022-07-12 03:37:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:28,857 INFO L225 Difference]: With dead ends: 63 [2022-07-12 03:37:28,857 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 03:37:28,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=542, Unknown=5, NotChecked=260, Total=930 [2022-07-12 03:37:28,858 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:28,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 411 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 280 Invalid, 0 Unknown, 199 Unchecked, 0.3s Time] [2022-07-12 03:37:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 03:37:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-07-12 03:37:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-07-12 03:37:28,871 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 31 [2022-07-12 03:37:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:28,872 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-07-12 03:37:28,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-07-12 03:37:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:37:28,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:28,873 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:28,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:29,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:29,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1832566487, now seen corresponding path program 4 times [2022-07-12 03:37:29,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:29,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138366091] [2022-07-12 03:37:29,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:29,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138366091] [2022-07-12 03:37:29,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138366091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:29,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320794263] [2022-07-12 03:37:29,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:37:29,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:29,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:29,352 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:37:29,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:37:29,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:37:29,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:37:29,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 03:37:29,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:29,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:37:29,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:37:29,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:37:29,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:37:29,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:37:29,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:29,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:37:29,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:29,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 03:37:29,731 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:37:29,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:37:29,851 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2022-07-12 03:37:29,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:29,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:29,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:37:29,860 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:37:29,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2022-07-12 03:37:29,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:37:29,944 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:37:29,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-12 03:37:29,947 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-07-12 03:37:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:29,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:30,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:30,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 29 [2022-07-12 03:37:30,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:30,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 29 [2022-07-12 03:37:30,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:30,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-12 03:37:30,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:37:30,203 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 20 treesize of output 8 [2022-07-12 03:37:30,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:30,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:37:30,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:37:30,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 03:37:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:30,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320794263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:37:30,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:37:30,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-12 03:37:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343172043] [2022-07-12 03:37:30,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:37:30,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:37:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:37:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:37:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:37:30,229 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:37:30,375 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-07-12 03:37:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:37:30,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 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 32 [2022-07-12 03:37:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:37:30,376 INFO L225 Difference]: With dead ends: 89 [2022-07-12 03:37:30,376 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 03:37:30,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:37:30,377 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:37:30,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 196 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-07-12 03:37:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 03:37:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-07-12 03:37:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2022-07-12 03:37:30,385 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 32 [2022-07-12 03:37:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:37:30,385 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2022-07-12 03:37:30,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:37:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-07-12 03:37:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 03:37:30,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:37:30,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:37:30,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:37:30,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:30,609 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:37:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:37:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -974282402, now seen corresponding path program 3 times [2022-07-12 03:37:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:37:30,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173464954] [2022-07-12 03:37:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:37:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:37:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:37:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:37:30,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173464954] [2022-07-12 03:37:30,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173464954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:37:30,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131967165] [2022-07-12 03:37:30,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:37:30,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:37:30,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:37:30,820 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:37:30,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 03:37:30,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 03:37:30,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:37:30,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 03:37:30,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:37:30,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:37:30,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:37:30,976 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:37:30,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:37:31,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:31,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:31,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:37:31,049 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 27 treesize of output 30 [2022-07-12 03:37:31,094 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:37:31,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2022-07-12 03:37:31,097 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 41 treesize of output 41 [2022-07-12 03:37:31,221 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 03:37:31,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-12 03:37:31,224 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-12 03:37:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:37:31,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:37:31,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:31,413 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 154 treesize of output 153 [2022-07-12 03:37:31,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:31,423 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 72 treesize of output 76 [2022-07-12 03:37:31,680 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:31,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 365 [2022-07-12 03:37:31,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:37:31,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 270 treesize of output 308 [2022-07-12 03:37:38,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 03:37:38,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 03:37:38,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 03:37:39,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 03:37:39,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2022-07-12 03:38:11,914 WARN L233 SmtUtils]: Spent 26.88s on a formula simplification. DAG size of input: 194 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:38:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:12,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131967165] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:12,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:12,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-07-12 03:38:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038498572] [2022-07-12 03:38:12,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:12,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 03:38:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 03:38:12,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=588, Unknown=22, NotChecked=0, Total=702 [2022-07-12 03:38:12,020 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:13,503 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2022-07-12 03:38:13,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 03:38:13,504 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 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 34 [2022-07-12 03:38:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:13,505 INFO L225 Difference]: With dead ends: 82 [2022-07-12 03:38:13,505 INFO L226 Difference]: Without dead ends: 54 [2022-07-12 03:38:13,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=330, Invalid=1438, Unknown=38, NotChecked=0, Total=1806 [2022-07-12 03:38:13,506 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 165 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:13,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 417 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 250 Invalid, 0 Unknown, 45 Unchecked, 0.5s Time] [2022-07-12 03:38:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-12 03:38:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-07-12 03:38:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-07-12 03:38:13,513 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 34 [2022-07-12 03:38:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:13,514 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-07-12 03:38:13,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-07-12 03:38:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:38:13,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:13,515 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:13,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:13,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:13,722 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1909608239, now seen corresponding path program 5 times [2022-07-12 03:38:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:13,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239361463] [2022-07-12 03:38:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:14,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:14,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239361463] [2022-07-12 03:38:14,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239361463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:14,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789000930] [2022-07-12 03:38:14,217 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 03:38:14,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:14,219 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:38:14,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 03:38:17,465 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-12 03:38:17,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:17,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-12 03:38:17,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:17,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:38:17,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:38:17,519 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:38:17,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:38:17,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:38:17,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:17,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:38:17,603 INFO L356 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-07-12 03:38:17,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:38:17,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:38:17,775 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:38:17,775 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 36 [2022-07-12 03:38:17,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-12 03:38:17,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 29 treesize of output 21 [2022-07-12 03:38:17,922 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:38:17,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2022-07-12 03:38:17,927 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 18 treesize of output 18 [2022-07-12 03:38:17,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 18 [2022-07-12 03:38:17,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:17,998 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 26 treesize of output 10 [2022-07-12 03:38:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:18,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:18,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1017 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-12 03:38:18,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1012) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1017) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-12 03:38:18,135 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1001 Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1005 Int) (v_ArrVal_1008 Int) (v_ArrVal_1007 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (let ((.cse0 (select (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 v_ArrVal_1008) .cse3 v_ArrVal_1007)) .cse4 v_ArrVal_1012) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse2 v_ArrVal_1005) .cse3 v_ArrVal_1001)) .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) v_ArrVal_1017))) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)))) (not (<= v_ArrVal_1008 |c_ULTIMATE.start_main_~order~0#1|)) (not (<= (select .cse1 .cse3) v_ArrVal_1007)))))) is different from false [2022-07-12 03:38:18,164 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:38:18,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 117 [2022-07-12 03:38:18,262 INFO L356 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-07-12 03:38:18,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 233 [2022-07-12 03:38:18,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:18,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 166 [2022-07-12 03:38:18,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:18,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2022-07-12 03:38:18,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:18,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-07-12 03:38:18,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:18,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-12 03:38:18,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:18,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 03:38:18,837 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 9 [2022-07-12 03:38:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-12 03:38:18,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789000930] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:18,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:18,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-07-12 03:38:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387942322] [2022-07-12 03:38:18,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:18,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 03:38:18,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 03:38:18,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=285, Unknown=3, NotChecked=108, Total=462 [2022-07-12 03:38:18,912 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:19,583 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2022-07-12 03:38:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:38:19,584 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 03:38:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:19,586 INFO L225 Difference]: With dead ends: 77 [2022-07-12 03:38:19,586 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 03:38:19,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=592, Unknown=3, NotChecked=162, Total=930 [2022-07-12 03:38:19,587 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 82 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:19,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 276 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 121 Invalid, 0 Unknown, 192 Unchecked, 0.3s Time] [2022-07-12 03:38:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 03:38:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-07-12 03:38:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-07-12 03:38:19,595 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 36 [2022-07-12 03:38:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:19,595 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-07-12 03:38:19,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-07-12 03:38:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 03:38:19,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:19,596 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:19,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:19,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 03:38:19,812 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 444488987, now seen corresponding path program 1 times [2022-07-12 03:38:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:19,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565829165] [2022-07-12 03:38:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:20,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:20,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565829165] [2022-07-12 03:38:20,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565829165] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:20,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771354424] [2022-07-12 03:38:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:20,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:20,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:20,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:38:20,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 03:38:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:20,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 03:38:20,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:20,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:38:20,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:38:20,360 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:38:20,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:38:20,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-12 03:38:20,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:38:20,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:20,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:38:20,447 INFO L356 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-07-12 03:38:20,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:38:20,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:20,753 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 25 [2022-07-12 03:38:20,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:20,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:20,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:20,775 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:38:20,775 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-12 03:38:20,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:38:20,884 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:38:20,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2022-07-12 03:38:20,891 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 22 [2022-07-12 03:38:20,944 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 18 [2022-07-12 03:38:20,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:20,983 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 26 treesize of output 10 [2022-07-12 03:38:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:38:20,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:21,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1218) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-12 03:38:21,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1217) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1218) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-12 03:38:21,115 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (v_ArrVal_1208 Int) (v_ArrVal_1207 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (not (<= v_ArrVal_1207 |c_ULTIMATE.start_main_~order~0#1|)) (not (<= (select .cse0 .cse1) v_ArrVal_1208)) (let ((.cse2 (select (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 .cse3 v_ArrVal_1207) .cse1 v_ArrVal_1208)) .cse4 v_ArrVal_1217) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse3 v_ArrVal_1210) .cse1 v_ArrVal_1212)) .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) v_ArrVal_1218))) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)))))))) is different from false [2022-07-12 03:38:21,142 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:38:21,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 117 [2022-07-12 03:38:21,230 INFO L356 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-07-12 03:38:21,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 375 treesize of output 387 [2022-07-12 03:38:21,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:21,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 320 [2022-07-12 03:38:21,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:21,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 288 [2022-07-12 03:38:21,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:21,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-07-12 03:38:21,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:21,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-12 03:38:21,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:21,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 03:38:21,774 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 9 [2022-07-12 03:38:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 23 not checked. [2022-07-12 03:38:21,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771354424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:21,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:21,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2022-07-12 03:38:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695740999] [2022-07-12 03:38:21,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:21,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 03:38:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 03:38:21,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=423, Unknown=3, NotChecked=132, Total=650 [2022-07-12 03:38:21,851 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:22,577 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2022-07-12 03:38:22,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:38:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 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 39 [2022-07-12 03:38:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:22,578 INFO L225 Difference]: With dead ends: 89 [2022-07-12 03:38:22,578 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 03:38:22,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=740, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 03:38:22,579 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:22,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 313 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 136 Invalid, 0 Unknown, 209 Unchecked, 0.3s Time] [2022-07-12 03:38:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 03:38:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2022-07-12 03:38:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-07-12 03:38:22,589 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 39 [2022-07-12 03:38:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:22,589 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-07-12 03:38:22,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-07-12 03:38:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 03:38:22,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:22,590 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:22,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:22,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 03:38:22,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1993858009, now seen corresponding path program 4 times [2022-07-12 03:38:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:22,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827651768] [2022-07-12 03:38:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:22,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:23,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:23,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827651768] [2022-07-12 03:38:23,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827651768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:23,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554272228] [2022-07-12 03:38:23,221 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:38:23,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:23,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:23,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:38:23,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 03:38:23,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:38:23,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:23,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-12 03:38:23,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:23,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:38:23,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:38:23,609 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:38:23,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:38:23,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:38:23,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:38:23,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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-12 03:38:23,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:23,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:38:23,793 INFO L356 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-07-12 03:38:23,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 03:38:23,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:23,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:38:24,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,061 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:38:24,061 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 47 [2022-07-12 03:38:24,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,085 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 37 treesize of output 43 [2022-07-12 03:38:24,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,402 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:38:24,402 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 155 [2022-07-12 03:38:24,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,411 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 69 treesize of output 41 [2022-07-12 03:38:24,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,445 INFO L356 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2022-07-12 03:38:24,445 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 102 [2022-07-12 03:38:24,808 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 03:38:24,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 188 [2022-07-12 03:38:24,860 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-07-12 03:38:24,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 161 [2022-07-12 03:38:24,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:24,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:24,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:24,943 INFO L356 Elim1Store]: treesize reduction 64, result has 55.9 percent of original size [2022-07-12 03:38:24,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 132 [2022-07-12 03:38:24,970 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 48 treesize of output 34 [2022-07-12 03:38:25,084 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 20 treesize of output 12 [2022-07-12 03:38:25,229 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 47 treesize of output 31 [2022-07-12 03:38:25,233 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 38 treesize of output 22 [2022-07-12 03:38:25,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:25,243 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 26 treesize of output 10 [2022-07-12 03:38:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:25,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:25,373 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1428 Int) (v_ArrVal_1427 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1428) .cse3 v_ArrVal_1427)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (<= (select .cse0 (+ .cse1 8)) (select .cse0 (+ .cse1 4)))) (not (<= (select .cse2 .cse3) v_ArrVal_1427)) (not (<= v_ArrVal_1428 |c_ULTIMATE.start_main_~order~0#1|)))))) is different from false [2022-07-12 03:38:25,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1428 Int) (v_ArrVal_1427 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse4 (select .cse2 .cse3))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1428) .cse3 v_ArrVal_1427)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1430) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (<= (select .cse0 (+ .cse1 8)) (select .cse0 (+ .cse1 4)))) (not (<= .cse4 v_ArrVal_1427)) (< .cse4 v_ArrVal_1428))))) is different from false [2022-07-12 03:38:25,485 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1426 (Array Int Int)) (v_ArrVal_1420 Int) (v_ArrVal_1422 Int) (v_ArrVal_1421 Int) (v_ArrVal_1430 (Array Int Int)) (v_ArrVal_1424 Int) (v_ArrVal_1423 Int) (v_ArrVal_1425 Int) (v_ArrVal_1428 Int) (v_ArrVal_1427 Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse12 .cse4 v_ArrVal_1423) .cse5 v_ArrVal_1422))) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse8 (select .cse7 .cse6)) (.cse10 (+ 4 .cse9))) (let ((.cse0 (select .cse8 .cse10))) (or (< .cse0 v_ArrVal_1428) (let ((.cse1 (select (store .cse7 .cse6 (store (store .cse8 (+ 8 .cse9) v_ArrVal_1428) .cse10 v_ArrVal_1427)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse11 .cse4 v_ArrVal_1420) .cse5 v_ArrVal_1424)) .cse6 v_ArrVal_1426) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1425) .cse5 v_ArrVal_1421)) .cse6 v_ArrVal_1430) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (<= (select .cse1 (+ .cse2 8)) (select .cse1 (+ .cse2 4)))) (not (<= (select .cse12 .cse5) v_ArrVal_1422)) (not (<= .cse0 v_ArrVal_1427)) (not (<= v_ArrVal_1423 |c_ULTIMATE.start_main_~order~0#1|)))))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2022-07-12 03:38:25,841 INFO L356 Elim1Store]: treesize reduction 151, result has 59.4 percent of original size [2022-07-12 03:38:25,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 549306556 treesize of output 518898004