./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s5if.c -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 b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:18:02,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:18:02,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:18:02,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:18:02,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:18:02,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:18:02,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:18:02,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:18:02,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:18:02,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:18:02,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:18:02,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:18:02,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:18:02,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:18:02,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:18:02,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:18:02,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:18:02,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:18:02,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:18:02,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:18:02,764 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:18:02,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:18:02,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:18:02,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:18:02,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:18:02,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:18:02,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:18:02,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:18:02,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:18:02,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:18:02,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:18:02,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:18:02,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:18:02,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:18:02,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:18:02,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:18:02,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:18:02,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:18:02,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:18:02,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:18:02,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:18:02,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:18:02,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:18:02,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:18:02,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:18:02,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:18:02,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:18:02,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:18:02,819 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:18:02,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:18:02,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:18:02,820 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:18:02,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:18:02,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:18:02,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:18:02,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:18:02,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:18:02,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:18:02,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:18:02,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:18:02,823 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:18:02,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:18:02,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:18:02,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:18:02,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:18:02,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:18:02,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:18:02,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:18:02,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:18:02,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:18:02,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:18:02,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:18:02,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:18:02,826 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:18:02,826 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:18:02,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:18:02,827 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 -> b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d [2022-07-13 11:18:03,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:18:03,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:18:03,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:18:03,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:18:03,059 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:18:03,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5if.c [2022-07-13 11:18:03,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b386a67cb/c819d8f4a42e47e0aefadb8100a906f9/FLAGd7a815a8c [2022-07-13 11:18:03,516 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:18:03,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5if.c [2022-07-13 11:18:03,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b386a67cb/c819d8f4a42e47e0aefadb8100a906f9/FLAGd7a815a8c [2022-07-13 11:18:03,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b386a67cb/c819d8f4a42e47e0aefadb8100a906f9 [2022-07-13 11:18:03,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:18:03,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:18:03,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:18:03,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:18:03,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:18:03,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111308c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03, skipping insertion in model container [2022-07-13 11:18:03,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:18:03,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:18:03,689 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/array-fpi/s5if.c[587,600] [2022-07-13 11:18:03,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:18:03,710 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:18:03,719 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/array-fpi/s5if.c[587,600] [2022-07-13 11:18:03,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:18:03,736 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:18:03,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03 WrapperNode [2022-07-13 11:18:03,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:18:03,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:18:03,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:18:03,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:18:03,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,764 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-13 11:18:03,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:18:03,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:18:03,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:18:03,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:18:03,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:18:03,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:18:03,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:18:03,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:18:03,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (1/1) ... [2022-07-13 11:18:03,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:18:03,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:03,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:18:03,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:18:03,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:18:03,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:18:03,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:18:03,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:18:03,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:18:03,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:18:03,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:18:03,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:18:03,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:18:03,933 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:18:03,934 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:18:04,057 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:18:04,062 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:18:04,063 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:18:04,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:18:04 BoogieIcfgContainer [2022-07-13 11:18:04,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:18:04,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:18:04,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:18:04,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:18:04,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:18:03" (1/3) ... [2022-07-13 11:18:04,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b92c72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:18:04, skipping insertion in model container [2022-07-13 11:18:04,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:18:03" (2/3) ... [2022-07-13 11:18:04,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b92c72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:18:04, skipping insertion in model container [2022-07-13 11:18:04,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:18:04" (3/3) ... [2022-07-13 11:18:04,089 INFO L111 eAbstractionObserver]: Analyzing ICFG s5if.c [2022-07-13 11:18:04,106 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:18:04,106 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:18:04,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:18:04,178 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@6b78c8d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b7184fb [2022-07-13 11:18:04,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:18:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 11:18:04,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:04,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:04,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-07-13 11:18:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:04,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702662975] [2022-07-13 11:18:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:04,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:04,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702662975] [2022-07-13 11:18:04,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702662975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:18:04,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:18:04,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:18:04,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062862705] [2022-07-13 11:18:04,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:18:04,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:18:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:18:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:18:04,411 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:04,430 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-07-13 11:18:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:18:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-13 11:18:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:04,439 INFO L225 Difference]: With dead ends: 34 [2022-07-13 11:18:04,440 INFO L226 Difference]: Without dead ends: 15 [2022-07-13 11:18:04,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:18:04,451 INFO L413 NwaCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:04,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:18:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-13 11:18:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 11:18:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-13 11:18:04,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-07-13 11:18:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:04,482 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-13 11:18:04,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-13 11:18:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 11:18:04,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:04,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:04,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:18:04,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:04,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-07-13 11:18:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:04,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762253840] [2022-07-13 11:18:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:04,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:04,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762253840] [2022-07-13 11:18:04,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762253840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:18:04,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:18:04,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:18:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903807433] [2022-07-13 11:18:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:18:04,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:18:04,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:04,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:18:04,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:18:04,589 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:04,644 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-13 11:18:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:18:04,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-13 11:18:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:04,646 INFO L225 Difference]: With dead ends: 28 [2022-07-13 11:18:04,647 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 11:18:04,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:18:04,655 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:04,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:18:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 11:18:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-07-13 11:18:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-13 11:18:04,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-07-13 11:18:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:04,672 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-13 11:18:04,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-13 11:18:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:18:04,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:04,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:04,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:18:04,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-07-13 11:18:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:04,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816380334] [2022-07-13 11:18:04,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:05,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:05,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816380334] [2022-07-13 11:18:05,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816380334] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:05,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129841442] [2022-07-13 11:18:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:05,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:05,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:05,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:05,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:18:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:05,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 11:18:05,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:05,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:18:05,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:18:05,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:05,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:18:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:05,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:05,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:18:05,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-13 11:18:05,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:18:05,809 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 26 treesize of output 18 [2022-07-13 11:18:05,815 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 22 treesize of output 10 [2022-07-13 11:18:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:05,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129841442] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:05,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:05,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2022-07-13 11:18:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894497682] [2022-07-13 11:18:05,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:05,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 11:18:05,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 11:18:05,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=333, Unknown=2, NotChecked=0, Total=420 [2022-07-13 11:18:05,834 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:06,090 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-07-13 11:18:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:18:06,090 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 11:18:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:06,093 INFO L225 Difference]: With dead ends: 46 [2022-07-13 11:18:06,093 INFO L226 Difference]: Without dead ends: 41 [2022-07-13 11:18:06,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=504, Unknown=2, NotChecked=0, Total=650 [2022-07-13 11:18:06,097 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:06,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2022-07-13 11:18:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-13 11:18:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2022-07-13 11:18:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-13 11:18:06,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 16 [2022-07-13 11:18:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:06,105 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-13 11:18:06,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-13 11:18:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:18:06,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:06,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:06,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:06,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:06,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-07-13 11:18:06,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:06,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843819107] [2022-07-13 11:18:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:06,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:06,342 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:18:06,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146914542] [2022-07-13 11:18:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:06,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:06,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:06,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:18:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:06,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:18:06,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:06,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:18:06,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 11:18:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:06,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:06,468 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 14 treesize of output 12 [2022-07-13 11:18:06,470 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 22 treesize of output 20 [2022-07-13 11:18:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:06,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843819107] [2022-07-13 11:18:06,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:18:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146914542] [2022-07-13 11:18:06,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146914542] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:06,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:18:06,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-07-13 11:18:06,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506764286] [2022-07-13 11:18:06,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:06,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:18:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:06,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:18:06,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:18:06,484 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:06,550 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-13 11:18:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:18:06,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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) Word has length 16 [2022-07-13 11:18:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:06,552 INFO L225 Difference]: With dead ends: 38 [2022-07-13 11:18:06,553 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 11:18:06,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:18:06,555 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:06,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:18:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 11:18:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-13 11:18:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-13 11:18:06,563 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-07-13 11:18:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:06,564 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-13 11:18:06,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-13 11:18:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:18:06,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:06,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:06,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:06,790 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,SelfDestructingSolverStorable3 [2022-07-13 11:18:06,791 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-07-13 11:18:06,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:06,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331960608] [2022-07-13 11:18:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:06,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331960608] [2022-07-13 11:18:06,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331960608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:06,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990892897] [2022-07-13 11:18:06,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:18:06,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:06,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:06,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:06,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:18:06,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:18:06,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:06,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:18:06,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:07,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:07,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990892897] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:07,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:07,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:18:07,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849213750] [2022-07-13 11:18:07,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:07,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:18:07,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:18:07,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:18:07,044 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:07,174 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-07-13 11:18:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:18:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 11:18:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:07,175 INFO L225 Difference]: With dead ends: 33 [2022-07-13 11:18:07,175 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 11:18:07,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:18:07,176 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:07,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:18:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 11:18:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-07-13 11:18:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-13 11:18:07,180 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-07-13 11:18:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:07,180 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-13 11:18:07,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-13 11:18:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 11:18:07,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:07,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:07,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:07,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:07,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-07-13 11:18:07,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:07,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230260053] [2022-07-13 11:18:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:07,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:07,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230260053] [2022-07-13 11:18:07,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230260053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:07,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207250140] [2022-07-13 11:18:07,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:18:07,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:07,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:07,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:07,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:18:07,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:18:07,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:07,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:18:07,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:07,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:07,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207250140] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:07,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:07,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:18:07,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665049793] [2022-07-13 11:18:07,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:07,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:18:07,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:07,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:18:07,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:18:07,559 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:07,630 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-13 11:18:07,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:18:07,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 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 19 [2022-07-13 11:18:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:07,631 INFO L225 Difference]: With dead ends: 37 [2022-07-13 11:18:07,631 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 11:18:07,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:18:07,632 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:07,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:18:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 11:18:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-13 11:18:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-13 11:18:07,636 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-07-13 11:18:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:07,636 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-13 11:18:07,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-13 11:18:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:18:07,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:07,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:07,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:07,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:07,858 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:07,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:07,859 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-07-13 11:18:07,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:07,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786663851] [2022-07-13 11:18:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:08,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:08,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786663851] [2022-07-13 11:18:08,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786663851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:08,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192651844] [2022-07-13 11:18:08,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:18:08,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:08,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:08,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:08,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:18:08,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:18:08,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:08,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-13 11:18:08,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:08,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:18:08,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:08,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:08,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:08,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:08,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:08,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:18:08,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:08,547 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:18:08,548 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 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-13 11:18:08,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:08,662 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:18:08,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 38 [2022-07-13 11:18:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:08,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:13,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (= (* 5 ~N~0) (+ .cse0 .cse1 .cse2)) (not (= .cse1 5)) (not (= 5 .cse2)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:18:13,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (= (* 5 ~N~0) (+ .cse0 .cse1 .cse2)) (not (= .cse1 5)) (not (= 5 .cse2)))))))) is different from false [2022-07-13 11:18:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-13 11:18:13,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192651844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:13,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:13,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2022-07-13 11:18:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971132780] [2022-07-13 11:18:13,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:13,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 11:18:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 11:18:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=763, Unknown=4, NotChecked=114, Total=992 [2022-07-13 11:18:13,705 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:13,960 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-07-13 11:18:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:18:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 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 21 [2022-07-13 11:18:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:13,961 INFO L225 Difference]: With dead ends: 36 [2022-07-13 11:18:13,961 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 11:18:13,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=162, Invalid=964, Unknown=4, NotChecked=130, Total=1260 [2022-07-13 11:18:13,963 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:13,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2022-07-13 11:18:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 11:18:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-13 11:18:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-13 11:18:13,968 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2022-07-13 11:18:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:13,968 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-13 11:18:13,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-13 11:18:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:18:13,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:13,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:13,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 11:18:14,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:14,185 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2022-07-13 11:18:14,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:14,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940307307] [2022-07-13 11:18:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:14,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:18:14,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806744792] [2022-07-13 11:18:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:14,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:14,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:14,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:14,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:18:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:14,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 11:18:14,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:14,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:18:14,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:14,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:18:14,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 11:18:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:14,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:14,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-13 11:18:14,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-13 11:18:14,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:18:14,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-13 11:18:14,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:18:14,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-13 11:18:14,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:18:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-13 11:18:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:14,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940307307] [2022-07-13 11:18:14,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:18:14,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806744792] [2022-07-13 11:18:14,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806744792] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:14,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:18:14,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-13 11:18:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976218130] [2022-07-13 11:18:14,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:14,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 11:18:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 11:18:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-07-13 11:18:14,511 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:14,681 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-13 11:18:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:18:14,681 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 11:18:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:14,682 INFO L225 Difference]: With dead ends: 41 [2022-07-13 11:18:14,682 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 11:18:14,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2022-07-13 11:18:14,683 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:14,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-07-13 11:18:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 11:18:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-13 11:18:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-13 11:18:14,689 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2022-07-13 11:18:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:14,689 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-13 11:18:14,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-13 11:18:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 11:18:14,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:14,690 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:14,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:14,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:14,902 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-07-13 11:18:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:14,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380282444] [2022-07-13 11:18:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:14,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:14,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380282444] [2022-07-13 11:18:14,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380282444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:14,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654003012] [2022-07-13 11:18:14,982 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:18:14,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:14,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:14,987 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:14,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:18:15,044 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:18:15,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:15,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:18:15,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:15,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:15,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654003012] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:15,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:15,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:18:15,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008915634] [2022-07-13 11:18:15,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:15,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:18:15,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:15,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:18:15,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:18:15,169 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:15,315 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-07-13 11:18:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:18:15,315 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-13 11:18:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:15,315 INFO L225 Difference]: With dead ends: 41 [2022-07-13 11:18:15,316 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 11:18:15,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:18:15,316 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:15,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 28 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:18:15,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 11:18:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-07-13 11:18:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-13 11:18:15,321 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-07-13 11:18:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:15,321 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-13 11:18:15,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-13 11:18:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:18:15,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:15,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:15,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:15,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:15,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2022-07-13 11:18:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:15,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733089183] [2022-07-13 11:18:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:15,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:15,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733089183] [2022-07-13 11:18:15,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733089183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:15,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673373210] [2022-07-13 11:18:15,583 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:18:15,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:15,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:15,584 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:15,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:18:15,645 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:18:15,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:15,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:18:15,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:15,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:15,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673373210] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:15,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:15,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:18:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932729593] [2022-07-13 11:18:15,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:15,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:18:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:18:15,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:18:15,730 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-13 11:18:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:15,814 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-07-13 11:18:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:18:15,814 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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 24 [2022-07-13 11:18:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:15,815 INFO L225 Difference]: With dead ends: 45 [2022-07-13 11:18:15,815 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 11:18:15,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:18:15,816 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:15,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 21 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:18:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 11:18:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-07-13 11:18:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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-13 11:18:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-13 11:18:15,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-07-13 11:18:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:15,821 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-13 11:18:15,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-13 11:18:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-13 11:18:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:18:15,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:15,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:15,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:16,037 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,SelfDestructingSolverStorable9 [2022-07-13 11:18:16,038 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:16,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2022-07-13 11:18:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:16,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223408436] [2022-07-13 11:18:16,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:16,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:16,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223408436] [2022-07-13 11:18:16,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223408436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:16,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009979104] [2022-07-13 11:18:16,494 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:18:16,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:16,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:16,495 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:18:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:16,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-13 11:18:16,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:16,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-13 11:18:16,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:18:16,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:16,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:16,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:16,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:18:16,814 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:18:16,814 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 1 case distinctions, treesize of input 63 treesize of output 41 [2022-07-13 11:18:16,951 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:18:16,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 63 [2022-07-13 11:18:17,072 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:18:17,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 35 [2022-07-13 11:18:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:17,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:28,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse0 .cse2 .cse3 .cse1)) (not (= .cse2 5))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:18:28,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 5)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse0 .cse2 .cse3 .cse1)) (not (= .cse2 5))))))))) is different from false [2022-07-13 11:18:28,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (= (* 5 ~N~0) (+ .cse0 .cse2 .cse3 .cse1)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= .cse2 5))))))))) is different from false [2022-07-13 11:18:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-13 11:18:28,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009979104] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:28,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:28,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 37 [2022-07-13 11:18:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924522572] [2022-07-13 11:18:28,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:28,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 11:18:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:28,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 11:18:28,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1003, Unknown=9, NotChecked=198, Total=1332 [2022-07-13 11:18:28,638 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:28,828 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-07-13 11:18:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:18:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-13 11:18:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:28,829 INFO L225 Difference]: With dead ends: 45 [2022-07-13 11:18:28,829 INFO L226 Difference]: Without dead ends: 41 [2022-07-13 11:18:28,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=156, Invalid=1179, Unknown=9, NotChecked=216, Total=1560 [2022-07-13 11:18:28,831 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:28,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 107 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 202 Unchecked, 0.1s Time] [2022-07-13 11:18:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-13 11:18:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-07-13 11:18:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-13 11:18:28,837 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2022-07-13 11:18:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:28,838 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-13 11:18:28,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-13 11:18:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:18:28,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:28,839 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:28,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:29,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:29,055 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2022-07-13 11:18:29,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:29,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9234204] [2022-07-13 11:18:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:29,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:29,070 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:18:29,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063471710] [2022-07-13 11:18:29,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:18:29,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:29,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:29,072 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:29,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:18:29,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:18:29,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:29,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 11:18:29,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:29,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:18:29,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:18:29,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:18:29,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:18:29,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:18:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:29,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:29,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-13 11:18:29,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:18:29,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:18:29,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:18:29,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-13 11:18:29,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:18:29,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-13 11:18:29,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:18:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-13 11:18:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:29,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9234204] [2022-07-13 11:18:29,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:18:29,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063471710] [2022-07-13 11:18:29,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063471710] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:29,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:18:29,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-07-13 11:18:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649946420] [2022-07-13 11:18:29,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:29,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:18:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:18:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=128, Unknown=3, NotChecked=72, Total=240 [2022-07-13 11:18:29,368 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:29,562 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-07-13 11:18:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:18:29,563 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-13 11:18:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:29,563 INFO L225 Difference]: With dead ends: 49 [2022-07-13 11:18:29,563 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 11:18:29,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2022-07-13 11:18:29,564 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:29,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 191 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-07-13 11:18:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 11:18:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-07-13 11:18:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-07-13 11:18:29,571 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2022-07-13 11:18:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:29,572 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-07-13 11:18:29,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-07-13 11:18:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:18:29,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:29,573 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:29,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:29,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 11:18:29,788 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2022-07-13 11:18:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:29,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186399887] [2022-07-13 11:18:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186399887] [2022-07-13 11:18:29,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186399887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:29,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099678995] [2022-07-13 11:18:29,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:18:29,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:29,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:29,880 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:29,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:18:29,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:18:29,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:29,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:18:29,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:30,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:30,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099678995] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:30,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:30,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:18:30,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276675944] [2022-07-13 11:18:30,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:30,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:18:30,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:30,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:18:30,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:18:30,077 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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-13 11:18:30,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:30,280 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-13 11:18:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:18:30,280 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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) Word has length 28 [2022-07-13 11:18:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:30,280 INFO L225 Difference]: With dead ends: 49 [2022-07-13 11:18:30,280 INFO L226 Difference]: Without dead ends: 45 [2022-07-13 11:18:30,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:18:30,281 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:30,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:18:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-13 11:18:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-07-13 11:18:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-07-13 11:18:30,287 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-07-13 11:18:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:30,287 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-07-13 11:18:30,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 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-13 11:18:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-07-13 11:18:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:18:30,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:30,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:30,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:30,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 11:18:30,507 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:30,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2022-07-13 11:18:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:30,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960716845] [2022-07-13 11:18:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:30,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960716845] [2022-07-13 11:18:30,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960716845] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:30,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796014788] [2022-07-13 11:18:30,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:18:30,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:30,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:30,601 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:30,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 11:18:30,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 11:18:30,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:30,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:18:30,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:30,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:30,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796014788] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:30,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:30,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:18:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314408103] [2022-07-13 11:18:30,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:30,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:18:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:30,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:18:30,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:18:30,822 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:30,954 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-07-13 11:18:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:18:30,959 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 11:18:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:30,960 INFO L225 Difference]: With dead ends: 53 [2022-07-13 11:18:30,960 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 11:18:30,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:18:30,961 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:30,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:18:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 11:18:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-07-13 11:18:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-07-13 11:18:30,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-07-13 11:18:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:30,966 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-07-13 11:18:30,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-07-13 11:18:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:18:30,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:30,967 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:30,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 11:18:31,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 11:18:31,187 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2022-07-13 11:18:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:31,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104698782] [2022-07-13 11:18:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:18:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:31,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:18:31,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104698782] [2022-07-13 11:18:31,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104698782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:18:31,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904769648] [2022-07-13 11:18:31,738 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:18:31,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:31,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:31,739 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:31,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 11:18:31,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:18:31,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:31,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-13 11:18:31,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:31,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:18:31,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:31,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:31,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:31,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:31,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:18:32,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:18:32,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,265 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:18:32,265 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 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-13 11:18:32,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,425 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:18:32,425 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 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-13 11:18:32,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,569 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:18:32,569 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-13 11:18:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:18:32,662 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:18:32,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-07-13 11:18:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:18:32,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:18:58,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (not (= .cse2 5)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse4 .cse3 .cse2 .cse0 .cse1)))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:18:58,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 5)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 5 .cse1)) (not (= .cse2 5)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse4 .cse3 .cse2 .cse0 .cse1)))))))))) is different from false [2022-07-13 11:18:58,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse2 5)) (not (= .cse3 5)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 5 ~N~0) (+ .cse4 .cse3 .cse2 .cse0 .cse1)))))))))) is different from false [2022-07-13 11:18:58,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 5)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 5 .cse1)) (not (= .cse2 5)) (not (= .cse3 5)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 5 ~N~0) (+ .cse4 .cse3 .cse2 .cse0 .cse1)))))))))) is different from false [2022-07-13 11:18:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-13 11:18:59,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904769648] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:18:59,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:18:59,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2022-07-13 11:18:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889409344] [2022-07-13 11:18:59,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:18:59,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-13 11:18:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:18:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-13 11:18:59,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2074, Unknown=17, NotChecked=380, Total=2652 [2022-07-13 11:18:59,062 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:18:59,495 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-07-13 11:18:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 11:18:59,495 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 11:18:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:18:59,496 INFO L225 Difference]: With dead ends: 52 [2022-07-13 11:18:59,496 INFO L226 Difference]: Without dead ends: 48 [2022-07-13 11:18:59,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=223, Invalid=2326, Unknown=17, NotChecked=404, Total=2970 [2022-07-13 11:18:59,498 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:18:59,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 128 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 262 Unchecked, 0.1s Time] [2022-07-13 11:18:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-13 11:18:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-07-13 11:18:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-07-13 11:18:59,514 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2022-07-13 11:18:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:18:59,514 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-07-13 11:18:59,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-07-13 11:18:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:18:59,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:18:59,515 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:18:59,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:18:59,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 11:18:59,716 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:18:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:18:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2022-07-13 11:18:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:18:59,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180771645] [2022-07-13 11:18:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:18:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:18:59,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:18:59,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493750675] [2022-07-13 11:18:59,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:18:59,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:18:59,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:18:59,729 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:18:59,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 11:18:59,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 11:18:59,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:18:59,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 11:18:59,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:18:59,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:18:59,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:18:59,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 11:18:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 11:18:59,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-13 11:18:59,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:18:59,992 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 23 treesize of output 23 [2022-07-13 11:19:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:19:00,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:00,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_547 (Array Int Int))) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)))) is different from false [2022-07-13 11:19:00,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:19:00,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-13 11:19:00,219 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-13 11:19:00,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-07-13 11:19:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2022-07-13 11:19:00,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:00,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180771645] [2022-07-13 11:19:00,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:19:00,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493750675] [2022-07-13 11:19:00,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493750675] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:00,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:19:00,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-13 11:19:00,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017386284] [2022-07-13 11:19:00,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 11:19:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 11:19:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2022-07-13 11:19:00,230 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:04,320 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-13 11:19:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:19:04,320 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 11:19:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:04,321 INFO L225 Difference]: With dead ends: 55 [2022-07-13 11:19:04,321 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 11:19:04,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=73, Invalid=165, Unknown=6, NotChecked=28, Total=272 [2022-07-13 11:19:04,322 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:04,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 56 Unchecked, 0.0s Time] [2022-07-13 11:19:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 11:19:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-13 11:19:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-07-13 11:19:04,331 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2022-07-13 11:19:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:04,331 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-07-13 11:19:04,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-07-13 11:19:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 11:19:04,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:04,332 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:04,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-13 11:19:04,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:04,547 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2022-07-13 11:19:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:04,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012598531] [2022-07-13 11:19:04,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:04,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:04,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012598531] [2022-07-13 11:19:04,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012598531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:04,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525117620] [2022-07-13 11:19:04,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:19:04,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:04,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:04,672 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:04,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 11:19:04,785 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-13 11:19:04,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:04,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:19:04,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:04,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:04,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525117620] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:04,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:04,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:19:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014259087] [2022-07-13 11:19:04,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:19:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:19:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:19:04,972 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:05,260 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-13 11:19:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 11:19:05,260 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-13 11:19:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:05,260 INFO L225 Difference]: With dead ends: 69 [2022-07-13 11:19:05,261 INFO L226 Difference]: Without dead ends: 65 [2022-07-13 11:19:05,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:19:05,262 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:05,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:19:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-13 11:19:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2022-07-13 11:19:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-07-13 11:19:05,269 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2022-07-13 11:19:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:05,269 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-07-13 11:19:05,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-07-13 11:19:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:19:05,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:05,270 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:05,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-13 11:19:05,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 11:19:05,484 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2022-07-13 11:19:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:05,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002871968] [2022-07-13 11:19:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:05,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002871968] [2022-07-13 11:19:05,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002871968] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:05,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408929893] [2022-07-13 11:19:05,599 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:19:05,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:05,600 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:05,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 11:19:05,688 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-13 11:19:05,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:05,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:19:05,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:05,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:05,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408929893] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:05,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:05,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:19:05,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329493188] [2022-07-13 11:19:05,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:05,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:19:05,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:19:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:19:05,869 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:06,010 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-07-13 11:19:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:19:06,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 11:19:06,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:06,011 INFO L225 Difference]: With dead ends: 78 [2022-07-13 11:19:06,011 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:19:06,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:19:06,011 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 61 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:06,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 34 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:19:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:19:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-07-13 11:19:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 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-13 11:19:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-07-13 11:19:06,019 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2022-07-13 11:19:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:06,019 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-07-13 11:19:06,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-07-13 11:19:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:19:06,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:06,020 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:06,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 11:19:06,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 11:19:06,228 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2022-07-13 11:19:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:06,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109592799] [2022-07-13 11:19:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:06,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109592799] [2022-07-13 11:19:06,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109592799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:06,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427526612] [2022-07-13 11:19:06,815 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:19:06,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:06,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:06,816 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:06,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 11:19:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:06,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-13 11:19:06,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:06,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:19:06,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:19:06,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:06,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:06,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 14 treesize of output 16 [2022-07-13 11:19:06,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:06,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:07,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:19:07,306 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:07,306 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 1 case distinctions, treesize of input 59 treesize of output 41 [2022-07-13 11:19:07,466 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:19:07,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 63 [2022-07-13 11:19:07,646 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:19:07,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-07-13 11:19:07,813 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:07,814 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 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-13 11:19:07,912 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:07,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 33 [2022-07-13 11:19:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:07,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:50,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int) (v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_226| Int) (|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~i~0#1_222| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_222| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_220| 4))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (not (= 5 .cse2)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse3 .cse0 .cse2 .cse1 .cse4 .cse5)) (not (= 5 .cse4))))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:19:51,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int) (v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_226| Int) (|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~i~0#1_222| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_222| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_220| 4))))) (or (not (= .cse0 5)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse3 .cse0 .cse2 .cse1 .cse4 .cse5)) (not (= 5 .cse4))))))))))) is different from false [2022-07-13 11:19:51,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int) (v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_226| Int) (|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~i~0#1_222| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_222| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_220| 4))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (not (= 5 .cse2)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse3 .cse0 .cse2 .cse1 .cse4 .cse5)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 5 .cse4))))))))))) is different from false [2022-07-13 11:19:51,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int) (v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_226| Int) (|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~i~0#1_222| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_222| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_220| 4))))) (or (not (= .cse0 5)) (not (= 5 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 5 .cse2)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse3 .cse0 .cse2 .cse1 .cse4 .cse5)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 5 .cse4))))))))))) is different from false [2022-07-13 11:19:51,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_224| Int) (v_ArrVal_710 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_226| Int) (|v_ULTIMATE.start_main_~i~0#1_220| Int) (|v_ULTIMATE.start_main_~i~0#1_222| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)))) (.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_226| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_224| 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_222| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse2 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_220| 4))))) (or (not (= .cse0 5)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse3 .cse0 .cse2 .cse1 .cse4 .cse5)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 5 .cse4))))))))))) is different from false [2022-07-13 11:19:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-13 11:19:51,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427526612] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:51,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:51,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 21] total 57 [2022-07-13 11:19:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127976721] [2022-07-13 11:19:51,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:51,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-13 11:19:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:51,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-13 11:19:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2446, Unknown=27, NotChecked=520, Total=3192 [2022-07-13 11:19:51,753 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 57 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:52,107 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-07-13 11:19:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 11:19:52,107 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 57 states have internal predecessors, (86), 0 states have call successors, (0), 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-13 11:19:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:52,108 INFO L225 Difference]: With dead ends: 65 [2022-07-13 11:19:52,108 INFO L226 Difference]: Without dead ends: 61 [2022-07-13 11:19:52,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=239, Invalid=2724, Unknown=27, NotChecked=550, Total=3540 [2022-07-13 11:19:52,109 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:52,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 169 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 394 Unchecked, 0.1s Time] [2022-07-13 11:19:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-13 11:19:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-07-13 11:19:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-07-13 11:19:52,131 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 36 [2022-07-13 11:19:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:52,131 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-07-13 11:19:52,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 57 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-07-13 11:19:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:19:52,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:52,132 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:52,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 11:19:52,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:52,355 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash 83735393, now seen corresponding path program 4 times [2022-07-13 11:19:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:52,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593779180] [2022-07-13 11:19:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:52,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:19:52,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3225652] [2022-07-13 11:19:52,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:19:52,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:52,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:52,366 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:52,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 11:19:52,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:19:52,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:52,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-13 11:19:52,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:52,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 11 [2022-07-13 11:19:52,546 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:19:52,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 11:19:52,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:52,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:19:52,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:52,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:19:52,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:52,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:19:52,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:19:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:19:52,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:52,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-07-13 11:19:52,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2022-07-13 11:19:52,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:19:52,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2022-07-13 11:19:52,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_781 (Array Int Int)) (v_ArrVal_777 Int)) (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:19:52,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_249| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_249|)) (forall ((v_ArrVal_781 (Array Int Int)) (v_ArrVal_777 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_249| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)))) is different from false [2022-07-13 11:19:52,803 INFO L356 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-07-13 11:19:52,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-13 11:19:52,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:19:52,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-13 11:19:52,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:19:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 31 not checked. [2022-07-13 11:19:52,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:52,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593779180] [2022-07-13 11:19:52,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:19:52,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3225652] [2022-07-13 11:19:52,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3225652] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:52,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:19:52,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-13 11:19:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109762258] [2022-07-13 11:19:52,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:52,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 11:19:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 11:19:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=364, Unknown=6, NotChecked=258, Total=702 [2022-07-13 11:19:52,897 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:55,009 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_249| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_249|)) (forall ((v_ArrVal_781 (Array Int Int)) (v_ArrVal_777 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_249| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_781) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)))) (= 2 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= 5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:19:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:55,279 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-13 11:19:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 11:19:55,280 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 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 36 [2022-07-13 11:19:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:55,280 INFO L225 Difference]: With dead ends: 69 [2022-07-13 11:19:55,280 INFO L226 Difference]: Without dead ends: 60 [2022-07-13 11:19:55,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=112, Invalid=611, Unknown=7, NotChecked=392, Total=1122 [2022-07-13 11:19:55,281 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:55,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 395 Invalid, 0 Unknown, 190 Unchecked, 0.2s Time] [2022-07-13 11:19:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-13 11:19:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-07-13 11:19:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-07-13 11:19:55,292 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 36 [2022-07-13 11:19:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:55,293 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-07-13 11:19:55,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-07-13 11:19:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:19:55,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:55,294 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:55,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 11:19:55,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:55,507 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash -746726435, now seen corresponding path program 14 times [2022-07-13 11:19:55,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:55,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285709225] [2022-07-13 11:19:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:55,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:55,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285709225] [2022-07-13 11:19:55,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285709225] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:55,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678596715] [2022-07-13 11:19:55,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:19:55,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:55,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:55,673 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:55,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 11:19:55,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:19:55,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:55,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 11:19:55,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:55,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:55,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678596715] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:55,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:55,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-07-13 11:19:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497686039] [2022-07-13 11:19:55,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:55,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 11:19:55,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:55,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 11:19:55,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:19:55,976 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:56,317 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-07-13 11:19:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 11:19:56,318 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-13 11:19:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:56,318 INFO L225 Difference]: With dead ends: 77 [2022-07-13 11:19:56,318 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 11:19:56,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 11:19:56,319 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 80 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:56,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 40 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:19:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 11:19:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 45. [2022-07-13 11:19:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-07-13 11:19:56,328 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 38 [2022-07-13 11:19:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:56,328 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-07-13 11:19:56,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-07-13 11:19:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:19:56,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:56,329 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:56,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-13 11:19:56,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:56,539 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash 465948487, now seen corresponding path program 15 times [2022-07-13 11:19:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:56,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386518493] [2022-07-13 11:19:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:56,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386518493] [2022-07-13 11:19:56,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386518493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:56,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24302733] [2022-07-13 11:19:56,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:19:56,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:56,668 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:56,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 11:19:56,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-13 11:19:56,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:56,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 11:19:56,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:56,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:19:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:56,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24302733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:19:56,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:19:56,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-07-13 11:19:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577470997] [2022-07-13 11:19:56,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:19:56,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 11:19:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:19:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 11:19:56,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:19:56,990 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:19:57,171 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-07-13 11:19:57,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:19:57,173 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-13 11:19:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:19:57,173 INFO L225 Difference]: With dead ends: 86 [2022-07-13 11:19:57,174 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 11:19:57,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2022-07-13 11:19:57,174 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:19:57,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 26 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:19:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 11:19:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-07-13 11:19:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 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-13 11:19:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-13 11:19:57,183 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 39 [2022-07-13 11:19:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:19:57,184 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-13 11:19:57,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:19:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-13 11:19:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:19:57,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:19:57,184 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:19:57,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-13 11:19:57,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 11:19:57,385 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:19:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:19:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash -552579063, now seen corresponding path program 16 times [2022-07-13 11:19:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:19:57,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974227525] [2022-07-13 11:19:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:19:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:19:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:19:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:19:58,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974227525] [2022-07-13 11:19:58,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974227525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:19:58,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360779682] [2022-07-13 11:19:58,107 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:19:58,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:19:58,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:19:58,108 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:19:58,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-13 11:19:58,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:19:58,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:19:58,184 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-13 11:19:58,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:19:58,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:19:58,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:58,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:58,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:58,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:58,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:19:58,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:19:58,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,822 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:58,822 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 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-13 11:19:58,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:58,995 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:58,995 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 1 case distinctions, treesize of input 61 treesize of output 43 [2022-07-13 11:19:59,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:59,161 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:59,161 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 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-13 11:19:59,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:59,313 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:59,314 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 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-13 11:19:59,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:59,494 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:59,494 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 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-13 11:19:59,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:19:59,612 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:19:59,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 34 [2022-07-13 11:19:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:19:59,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:21:21,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_324| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_967 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_321| Int) (|v_ULTIMATE.start_main_~i~0#1_319| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_967 (+ (* |v_ULTIMATE.start_main_~i~0#1_324| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_321| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_319| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_315| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_313| 4))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (* 5 ~N~0)) (not (= 5 .cse5)) (not (= 5 .cse6)) (not (= 5 .cse4)) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (= .cse0 5)))))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-13 11:21:21,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_324| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_967 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_321| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_319| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_967 (+ (* |v_ULTIMATE.start_main_~i~0#1_324| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_321| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_319| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_315| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_313| 4))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (* 5 ~N~0)) (not (= 5 .cse5)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 5 .cse6)) (not (= 5 .cse4)) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (= .cse0 5)))))))))))) is different from false [2022-07-13 11:21:21,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_324| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_967 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_321| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_319| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_967 (+ (* |v_ULTIMATE.start_main_~i~0#1_324| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_321| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_319| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_315| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_313| 4))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (* 5 ~N~0)) (not (= 5 .cse5)) (not (= 5 .cse6)) (not (= 5 .cse4)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= .cse0 5)))))))))))) is different from false [2022-07-13 11:21:22,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_324| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_967 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_321| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_319| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_967 (+ (* |v_ULTIMATE.start_main_~i~0#1_324| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_321| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_319| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_315| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_313| 4))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (* 5 ~N~0)) (not (= 5 .cse5)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 5 .cse6)) (not (= 5 .cse4)) (not (= 5 .cse2)) (not (= 5 .cse3)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= .cse0 5)))))))))))) is different from false [2022-07-13 11:21:22,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_324| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_967 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_321| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_319| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_967 (+ (* |v_ULTIMATE.start_main_~i~0#1_324| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_321| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_319| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_315| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_313| 4))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (* 5 ~N~0)) (not (= 5 .cse5)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (not (= 5 .cse6)) (not (= 5 .cse4)) (not (= 5 .cse2)) (not (= 5 .cse3)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse0 5)))))))))))) is different from false [2022-07-13 11:21:23,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_324| Int) (|v_ULTIMATE.start_main_~i~0#1_313| Int) (v_ArrVal_967 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_321| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_319| Int) (|v_ULTIMATE.start_main_~i~0#1_315| Int) (|v_ULTIMATE.start_main_~i~0#1_317| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_967))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_967 (+ (* |v_ULTIMATE.start_main_~i~0#1_324| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_321| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_319| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_317| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_315| 4))))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_313| 4))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (* 5 ~N~0)) (not (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 5 .cse5)) (not (= 5 .cse6)) (not (= 5 .cse4)) (not (= 5 .cse2)) (< (+ 6 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 5 .cse3)) (not (= .cse0 5)))))))))))) is different from false [2022-07-13 11:21:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-07-13 11:21:23,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360779682] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:21:23,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:21:23,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 24] total 72 [2022-07-13 11:21:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682089415] [2022-07-13 11:21:23,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:21:23,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-13 11:21:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:21:23,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-13 11:21:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4021, Unknown=45, NotChecked=798, Total=5112 [2022-07-13 11:21:23,373 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:21:28,652 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-07-13 11:21:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:21:28,652 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-13 11:21:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:21:28,653 INFO L225 Difference]: With dead ends: 73 [2022-07-13 11:21:28,653 INFO L226 Difference]: Without dead ends: 69 [2022-07-13 11:21:28,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 87.6s TimeCoverageRelationStatistics Valid=290, Invalid=4381, Unknown=45, NotChecked=834, Total=5550 [2022-07-13 11:21:28,654 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:21:28,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 489 Invalid, 0 Unknown, 879 Unchecked, 0.2s Time] [2022-07-13 11:21:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-13 11:21:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-07-13 11:21:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-07-13 11:21:28,664 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 41 [2022-07-13 11:21:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:21:28,664 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-07-13 11:21:28,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-07-13 11:21:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:21:28,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:21:28,665 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:21:28,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-13 11:21:28,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-13 11:21:28,865 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:21:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:21:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 127479307, now seen corresponding path program 5 times [2022-07-13 11:21:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:21:28,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538120403] [2022-07-13 11:21:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:21:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:21:28,876 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:21:28,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292566418] [2022-07-13 11:21:28,877 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:21:28,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:28,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:21:28,878 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:21:28,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-13 11:21:29,029 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-13 11:21:29,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:21:29,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 11:21:29,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:21:29,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:21:29,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 11:21:29,112 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:21:29,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:21:29,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:21:29,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:21:29,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:21:29,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 11:21:29,252 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-07-13 11:21:29,252 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 21 treesize of output 10 [2022-07-13 11:21:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:21:29,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:21:29,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 5)) is different from false [2022-07-13 11:21:29,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:21:29,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:21:29,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:21:29,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:21:29,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 Int) (v_ArrVal_1050 (Array Int Int))) (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1046)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:21:29,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 Int) (v_ArrVal_1050 (Array Int Int))) (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1046)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1050) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-13 11:21:29,351 INFO L356 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-07-13 11:21:29,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-07-13 11:21:29,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:21:29,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-13 11:21:29,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:21:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 46 not checked. [2022-07-13 11:21:29,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:21:29,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538120403] [2022-07-13 11:21:29,400 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:21:29,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292566418] [2022-07-13 11:21:29,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292566418] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:21:29,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:21:29,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2022-07-13 11:21:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524933294] [2022-07-13 11:21:29,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:21:29,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 11:21:29,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:21:29,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 11:21:29,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=332, Unknown=7, NotChecked=294, Total=702 [2022-07-13 11:21:29,401 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:21:29,770 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-13 11:21:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 11:21:29,770 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-13 11:21:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:21:29,771 INFO L225 Difference]: With dead ends: 81 [2022-07-13 11:21:29,771 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 11:21:29,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=617, Unknown=7, NotChecked=392, Total=1122 [2022-07-13 11:21:29,772 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:21:29,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 497 Invalid, 0 Unknown, 266 Unchecked, 0.2s Time] [2022-07-13 11:21:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 11:21:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2022-07-13 11:21:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-07-13 11:21:29,783 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2022-07-13 11:21:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:21:29,783 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-07-13 11:21:29,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-07-13 11:21:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:21:29,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:21:29,784 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:21:29,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-13 11:21:29,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:29,984 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:21:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:21:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -105011125, now seen corresponding path program 17 times [2022-07-13 11:21:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:21:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706913353] [2022-07-13 11:21:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:21:29,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:21:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:21:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:21:30,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706913353] [2022-07-13 11:21:30,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706913353] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:21:30,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954603017] [2022-07-13 11:21:30,174 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:21:30,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:30,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:21:30,176 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:21:30,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-13 11:21:30,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-13 11:21:30,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:21:30,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 11:21:30,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:21:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:30,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:21:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:30,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954603017] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:21:30,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:21:30,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-07-13 11:21:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371847484] [2022-07-13 11:21:30,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:21:30,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 11:21:30,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:21:30,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 11:21:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:21:30,558 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 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-13 11:21:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:21:30,948 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-07-13 11:21:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 11:21:30,949 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 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 43 [2022-07-13 11:21:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:21:30,949 INFO L225 Difference]: With dead ends: 85 [2022-07-13 11:21:30,949 INFO L226 Difference]: Without dead ends: 81 [2022-07-13 11:21:30,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 11:21:30,951 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:21:30,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 34 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:21:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-13 11:21:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2022-07-13 11:21:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-13 11:21:30,959 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-13 11:21:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:21:30,960 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-13 11:21:30,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 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-13 11:21:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-13 11:21:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:21:30,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:21:30,960 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:21:30,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-13 11:21:31,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:31,167 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:21:31,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:21:31,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2029167523, now seen corresponding path program 18 times [2022-07-13 11:21:31,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:21:31,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803160273] [2022-07-13 11:21:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:21:31,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:21:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:21:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:31,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:21:31,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803160273] [2022-07-13 11:21:31,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803160273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:21:31,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101043307] [2022-07-13 11:21:31,337 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:21:31,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:31,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:21:31,338 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:21:31,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 11:21:31,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-13 11:21:31,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:21:31,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 11:21:31,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:21:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:31,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:21:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:31,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101043307] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:21:31,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:21:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-07-13 11:21:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457399747] [2022-07-13 11:21:31,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:21:31,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 11:21:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:21:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 11:21:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:21:31,717 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:21:31,951 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-07-13 11:21:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 11:21:31,951 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 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 44 [2022-07-13 11:21:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:21:31,952 INFO L225 Difference]: With dead ends: 94 [2022-07-13 11:21:31,952 INFO L226 Difference]: Without dead ends: 60 [2022-07-13 11:21:31,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 11:21:31,953 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:21:31,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 54 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:21:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-13 11:21:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-07-13 11:21:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-13 11:21:31,961 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 44 [2022-07-13 11:21:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:21:31,961 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-13 11:21:31,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-13 11:21:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:21:31,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:21:31,962 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:21:31,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-07-13 11:21:32,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-13 11:21:32,163 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:21:32,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:21:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash -111213349, now seen corresponding path program 19 times [2022-07-13 11:21:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:21:32,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800904349] [2022-07-13 11:21:32,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:21:32,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:21:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:21:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:21:33,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800904349] [2022-07-13 11:21:33,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800904349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:21:33,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985974969] [2022-07-13 11:21:33,179 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:21:33,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:33,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:21:33,180 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:21:33,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-13 11:21:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:21:33,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-13 11:21:33,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:21:33,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:21:33,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:21:33,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:21:33,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:21:33,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:21:33,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:21:33,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:21:33,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:21:33,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:21:33,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:21:33,648 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:21:33,648 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 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-13 11:21:33,818 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:21:33,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 63 [2022-07-13 11:21:34,016 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-13 11:21:34,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2022-07-13 11:21:34,204 INFO L356 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-07-13 11:21:34,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 85 [2022-07-13 11:21:34,412 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:21:34,413 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 1 case distinctions, treesize of input 61 treesize of output 43 [2022-07-13 11:21:34,622 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:21:34,622 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 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-13 11:21:34,720 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 11:21:34,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 34 [2022-07-13 11:21:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:34,767 INFO L328 TraceCheckSpWp]: Computing backward predicates...