./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/shared_mem1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:22:03,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:22:03,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:22:03,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:22:03,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:22:03,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:22:03,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:22:03,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:22:03,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:22:03,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:22:03,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:22:03,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:22:03,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:22:03,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:22:03,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:22:03,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:22:03,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:22:03,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:22:03,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:22:03,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:22:03,929 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:22:03,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:22:03,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:22:03,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:22:03,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:22:03,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:22:03,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:22:03,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:22:03,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:22:03,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:22:03,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:22:03,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:22:03,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:22:03,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:22:03,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:22:03,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:22:03,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:22:03,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:22:03,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:22:03,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:22:03,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:22:03,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:22:03,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:22:03,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:22:03,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:22:03,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:22:03,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:22:03,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:22:03,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:22:03,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:22:03,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:22:03,994 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:22:03,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:22:03,995 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:22:03,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:22:03,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:22:03,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:22:03,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:22:03,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:22:03,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:22:03,996 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:22:03,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:22:03,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:22:03,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:22:03,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:22:03,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:22:03,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:22:03,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:22:03,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:22:03,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:22:03,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:22:03,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:22:03,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:22:03,999 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:22:03,999 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:22:03,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:22:03,999 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 -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2022-07-21 02:22:04,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:22:04,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:22:04,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:22:04,305 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:22:04,306 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:22:04,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-21 02:22:04,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30036a71f/37d713569422429eb8a1bbf2507d3160/FLAG980d1ec4d [2022-07-21 02:22:04,895 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:22:04,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-21 02:22:04,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30036a71f/37d713569422429eb8a1bbf2507d3160/FLAG980d1ec4d [2022-07-21 02:22:05,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30036a71f/37d713569422429eb8a1bbf2507d3160 [2022-07-21 02:22:05,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:22:05,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:22:05,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:22:05,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:22:05,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:22:05,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68af60e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05, skipping insertion in model container [2022-07-21 02:22:05,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:22:05,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:22:05,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2022-07-21 02:22:05,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:22:05,789 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:22:05,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2022-07-21 02:22:05,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:22:05,869 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:22:05,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05 WrapperNode [2022-07-21 02:22:05,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:22:05,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:22:05,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:22:05,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:22:05,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,931 INFO L137 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-07-21 02:22:05,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:22:05,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:22:05,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:22:05,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:22:05,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:22:05,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:22:05,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:22:05,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:22:05,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (1/1) ... [2022-07-21 02:22:05,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:22:06,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:22:06,021 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-21 02:22:06,044 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-21 02:22:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:22:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:22:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:22:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:22:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:22:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:22:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:22:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:22:06,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:22:06,206 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:22:06,208 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:22:06,346 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:22:06,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:22:06,351 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 02:22:06,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:22:06 BoogieIcfgContainer [2022-07-21 02:22:06,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:22:06,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:22:06,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:22:06,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:22:06,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:22:05" (1/3) ... [2022-07-21 02:22:06,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3800626d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:22:06, skipping insertion in model container [2022-07-21 02:22:06,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:22:05" (2/3) ... [2022-07-21 02:22:06,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3800626d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:22:06, skipping insertion in model container [2022-07-21 02:22:06,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:22:06" (3/3) ... [2022-07-21 02:22:06,358 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-07-21 02:22:06,369 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:22:06,369 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:22:06,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:22:06,440 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@68e2c4ab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@825da0c [2022-07-21 02:22:06,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:22:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 02:22:06,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:06,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:06,459 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1650103796, now seen corresponding path program 1 times [2022-07-21 02:22:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:06,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050352709] [2022-07-21 02:22:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:06,695 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-21 02:22:06,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:06,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050352709] [2022-07-21 02:22:06,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050352709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:22:06,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:22:06,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:22:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108370738] [2022-07-21 02:22:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:22:06,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:22:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:22:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:22:06,737 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:06,749 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-07-21 02:22:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:22:06,751 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-21 02:22:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:06,757 INFO L225 Difference]: With dead ends: 27 [2022-07-21 02:22:06,757 INFO L226 Difference]: Without dead ends: 13 [2022-07-21 02:22:06,760 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-21 02:22:06,764 INFO L413 NwaCegarLoop]: 20 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, 20 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-21 02:22:06,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:22:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-21 02:22:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-21 02:22:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-21 02:22:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-07-21 02:22:06,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2022-07-21 02:22:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:06,793 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-07-21 02:22:06,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-07-21 02:22:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 02:22:06,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:06,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:06,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:22:06,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash -812668617, now seen corresponding path program 1 times [2022-07-21 02:22:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:06,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812889194] [2022-07-21 02:22:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:06,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:07,200 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-21 02:22:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812889194] [2022-07-21 02:22:07,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812889194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:22:07,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:22:07,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 02:22:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211056488] [2022-07-21 02:22:07,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:22:07,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 02:22:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 02:22:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:22:07,205 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-21 02:22:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:07,424 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-07-21 02:22:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:22:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-21 02:22:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:07,427 INFO L225 Difference]: With dead ends: 29 [2022-07-21 02:22:07,428 INFO L226 Difference]: Without dead ends: 27 [2022-07-21 02:22:07,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-21 02:22:07,429 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:22:07,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:22:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-21 02:22:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-21 02:22:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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-21 02:22:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-21 02:22:07,435 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 11 [2022-07-21 02:22:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:07,435 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-21 02:22:07,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-21 02:22:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-07-21 02:22:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 02:22:07,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:07,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:07,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:22:07,437 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash -812666695, now seen corresponding path program 1 times [2022-07-21 02:22:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:07,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706745773] [2022-07-21 02:22:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:07,690 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-21 02:22:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:07,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706745773] [2022-07-21 02:22:07,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706745773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:22:07,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:22:07,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 02:22:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304195967] [2022-07-21 02:22:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:22:07,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:22:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:22:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:22:07,693 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-21 02:22:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:07,825 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-07-21 02:22:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:22:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-21 02:22:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:07,826 INFO L225 Difference]: With dead ends: 31 [2022-07-21 02:22:07,826 INFO L226 Difference]: Without dead ends: 24 [2022-07-21 02:22:07,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-21 02:22:07,828 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:22:07,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:22:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-21 02:22:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-21 02:22:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 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-21 02:22:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-21 02:22:07,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2022-07-21 02:22:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:07,834 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-21 02:22:07,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-21 02:22:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-21 02:22:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 02:22:07,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:07,835 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:07,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:22:07,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1760681901, now seen corresponding path program 1 times [2022-07-21 02:22:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:07,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559359785] [2022-07-21 02:22:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:08,159 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-21 02:22:08,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:08,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559359785] [2022-07-21 02:22:08,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559359785] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:22:08,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787419785] [2022-07-21 02:22:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:08,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:08,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:22:08,171 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-21 02:22:08,205 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-21 02:22:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:08,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-21 02:22:08,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:22:08,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,444 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 18 treesize of output 19 [2022-07-21 02:22:08,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-21 02:22:08,477 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:22:08,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 02:22:08,527 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-21 02:22:08,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-21 02:22:08,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-21 02:22:08,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-07-21 02:22:08,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,662 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 72 treesize of output 41 [2022-07-21 02:22:08,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2022-07-21 02:22:08,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,828 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 26 treesize of output 23 [2022-07-21 02:22:08,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,846 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 26 treesize of output 23 [2022-07-21 02:22:08,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,869 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 24 treesize of output 21 [2022-07-21 02:22:08,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:08,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-07-21 02:22:08,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:08,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:08,909 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:22:08,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 02:22:09,049 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 67 treesize of output 47 [2022-07-21 02:22:09,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:22:09,072 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-21 02:22:09,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2022-07-21 02:22:09,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-21 02:22:09,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:09,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2022-07-21 02:22:09,290 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-21 02:22:09,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:22:09,635 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-21 02:22:09,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787419785] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:22:09,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:22:09,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-07-21 02:22:09,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14745665] [2022-07-21 02:22:09,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:22:09,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 02:22:09,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:09,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 02:22:09,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-21 02:22:09,638 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:09,977 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-07-21 02:22:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 02:22:09,978 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-21 02:22:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:09,979 INFO L225 Difference]: With dead ends: 47 [2022-07-21 02:22:09,979 INFO L226 Difference]: Without dead ends: 45 [2022-07-21 02:22:09,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-07-21 02:22:09,980 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:22:09,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 92 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-07-21 02:22:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-21 02:22:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-07-21 02:22:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2022-07-21 02:22:09,986 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 14 [2022-07-21 02:22:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:09,987 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2022-07-21 02:22:09,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2022-07-21 02:22:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 02:22:09,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:09,988 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:10,019 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-21 02:22:10,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:10,212 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:10,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1760679979, now seen corresponding path program 1 times [2022-07-21 02:22:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:10,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783347361] [2022-07-21 02:22:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:10,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:10,457 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-21 02:22:10,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:10,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783347361] [2022-07-21 02:22:10,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783347361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:22:10,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103231822] [2022-07-21 02:22:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:10,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:10,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:22:10,468 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-21 02:22:10,494 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-21 02:22:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:10,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-21 02:22:10,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:22:10,612 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-21 02:22:10,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-07-21 02:22:10,641 INFO L356 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2022-07-21 02:22:10,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 91 [2022-07-21 02:22:10,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-21 02:22:10,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-21 02:22:10,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2022-07-21 02:22:10,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-07-21 02:22:10,811 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 0 case distinctions, treesize of input 50 treesize of output 36 [2022-07-21 02:22:10,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2022-07-21 02:22:10,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,845 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 18 treesize of output 19 [2022-07-21 02:22:10,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-21 02:22:10,872 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:22:10,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 02:22:10,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:10,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:22:11,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:11,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:11,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:22:11,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:11,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:11,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:11,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-07-21 02:22:11,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:11,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:11,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:11,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-07-21 02:22:11,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:11,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:11,064 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 02:22:11,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 02:22:11,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-07-21 02:22:11,196 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-07-21 02:22:11,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-21 02:22:11,234 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:22:11,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2022-07-21 02:22:11,240 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-21 02:22:11,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:22:11,520 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-21 02:22:11,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103231822] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:22:11,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:22:11,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-07-21 02:22:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919260783] [2022-07-21 02:22:11,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:22:11,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 02:22:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 02:22:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=180, Unknown=2, NotChecked=0, Total=240 [2022-07-21 02:22:11,523 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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-21 02:22:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:11,739 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-07-21 02:22:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:22:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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 14 [2022-07-21 02:22:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:11,741 INFO L225 Difference]: With dead ends: 44 [2022-07-21 02:22:11,741 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 02:22:11,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=245, Unknown=2, NotChecked=0, Total=342 [2022-07-21 02:22:11,742 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:22:11,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-07-21 02:22:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 02:22:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-07-21 02:22:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 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-21 02:22:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-21 02:22:11,746 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2022-07-21 02:22:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:11,747 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-21 02:22:11,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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-21 02:22:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-21 02:22:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 02:22:11,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:11,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:11,774 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-21 02:22:11,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:11,964 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash 187961508, now seen corresponding path program 1 times [2022-07-21 02:22:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:11,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975470775] [2022-07-21 02:22:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:12,181 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-21 02:22:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:12,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975470775] [2022-07-21 02:22:12,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975470775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:22:12,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578120904] [2022-07-21 02:22:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:12,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:12,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:22:12,184 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-21 02:22:12,185 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-21 02:22:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:12,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 02:22:12,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:22:12,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,284 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 18 treesize of output 19 [2022-07-21 02:22:12,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-07-21 02:22:12,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,301 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 30 treesize of output 30 [2022-07-21 02:22:12,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-21 02:22:12,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:12,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-21 02:22:12,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-21 02:22:12,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-21 02:22:12,455 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:22:12,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 102 [2022-07-21 02:22:12,462 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 38 [2022-07-21 02:22:12,467 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 56 treesize of output 54 [2022-07-21 02:22:12,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-07-21 02:22:12,618 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:22:12,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-07-21 02:22:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:22:12,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:22:12,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_514 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (not (<= (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_514)) (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_516)) (.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_515)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)))) (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_514)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2022-07-21 02:22:12,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_514 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_516)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_515)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_514)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (+ (select .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_514))))))) is different from false [2022-07-21 02:22:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 02:22:12,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578120904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:22:12,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:22:12,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 18 [2022-07-21 02:22:12,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928477882] [2022-07-21 02:22:12,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:22:12,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 02:22:12,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:12,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 02:22:12,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=206, Unknown=2, NotChecked=58, Total=306 [2022-07-21 02:22:12,758 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:13,541 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-07-21 02:22:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 02:22:13,542 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 02:22:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:13,543 INFO L225 Difference]: With dead ends: 52 [2022-07-21 02:22:13,543 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 02:22:13,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=356, Unknown=2, NotChecked=82, Total=552 [2022-07-21 02:22:13,544 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:22:13,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 125 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2022-07-21 02:22:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 02:22:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-21 02:22:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-21 02:22:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-21 02:22:13,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2022-07-21 02:22:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:13,548 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-21 02:22:13,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-21 02:22:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:22:13,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:13,548 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:13,579 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-21 02:22:13,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:13,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash -319487049, now seen corresponding path program 2 times [2022-07-21 02:22:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:13,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462572063] [2022-07-21 02:22:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:22:13,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:13,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462572063] [2022-07-21 02:22:13,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462572063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:22:13,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450404523] [2022-07-21 02:22:13,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:22:13,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:13,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:22:13,988 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-21 02:22:13,989 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-21 02:22:14,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:22:14,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:22:14,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 02:22:14,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:22:14,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,157 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 18 treesize of output 19 [2022-07-21 02:22:14,169 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:22:14,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-21 02:22:14,200 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-21 02:22:14,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-21 02:22:14,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-21 02:22:14,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-07-21 02:22:14,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,275 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 72 treesize of output 41 [2022-07-21 02:22:14,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2022-07-21 02:22:14,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,352 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 18 treesize of output 19 [2022-07-21 02:22:14,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,422 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:22:14,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,431 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:22:14,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,438 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2022-07-21 02:22:14,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-07-21 02:22:14,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:14,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:14,470 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:22:14,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:22:14,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,541 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 26 treesize of output 23 [2022-07-21 02:22:14,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,551 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 26 treesize of output 23 [2022-07-21 02:22:14,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2022-07-21 02:22:14,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-07-21 02:22:14,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:14,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:14,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:14,595 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:22:14,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 02:22:14,707 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 67 treesize of output 47 [2022-07-21 02:22:14,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:22:14,726 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-21 02:22:14,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2022-07-21 02:22:14,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-21 02:22:14,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:14,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2022-07-21 02:22:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:22:14,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:22:15,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 Int) (v_ArrVal_738 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_746 Int) (v_ArrVal_723 Int) (v_ArrVal_745 Int) (v_ArrVal_744 Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_721 Int) (v_ArrVal_722 (Array Int Int)) (v_ArrVal_731 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_8| Int) (v_ArrVal_719 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_9| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_724))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_729))) |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_734))) (store .cse9 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_744)))) (.cse2 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_717) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_722) |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_723)))) (store (store .cse8 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_740) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse8 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_741) |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_738))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (let ((.cse3 (select .cse0 .cse2)) (.cse4 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_719) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_725) |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_721)))) (store (store .cse5 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_742) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse5 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_732) |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_745))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (let ((.cse1 (select .cse3 .cse4))) (or (not (<= v_ArrVal_746 (+ (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_731) |v_ULTIMATE.start_main_~n~0#1.base_8|) 0)) (<= (select (select (store .cse0 .cse2 (store .cse3 .cse4 v_ArrVal_746)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_9|) 0)) (< 100 .cse1))))))) is different from false [2022-07-21 02:22:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-21 02:22:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450404523] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:22:15,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:22:15,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2022-07-21 02:22:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533719821] [2022-07-21 02:22:15,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:22:15,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 02:22:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 02:22:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2022-07-21 02:22:15,368 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:15,687 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-07-21 02:22:15,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 02:22:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 02:22:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:15,689 INFO L225 Difference]: With dead ends: 32 [2022-07-21 02:22:15,689 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:22:15,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=317, Unknown=1, NotChecked=38, Total=462 [2022-07-21 02:22:15,690 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:22:15,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 54 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 42 Unchecked, 0.0s Time] [2022-07-21 02:22:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:22:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2022-07-21 02:22:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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-21 02:22:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-07-21 02:22:15,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2022-07-21 02:22:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:15,693 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-07-21 02:22:15,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-07-21 02:22:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 02:22:15,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:15,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:15,721 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-21 02:22:15,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:15,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:15,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2098222328, now seen corresponding path program 1 times [2022-07-21 02:22:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:15,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477216459] [2022-07-21 02:22:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:22:16,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:16,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477216459] [2022-07-21 02:22:16,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477216459] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:22:16,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919876072] [2022-07-21 02:22:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:16,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:16,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:22:16,179 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-21 02:22:16,180 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-21 02:22:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:16,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-21 02:22:16,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:22:16,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,336 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 18 treesize of output 19 [2022-07-21 02:22:16,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,340 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 18 treesize of output 19 [2022-07-21 02:22:16,374 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-21 02:22:16,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-07-21 02:22:16,405 INFO L356 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2022-07-21 02:22:16,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 91 [2022-07-21 02:22:16,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-21 02:22:16,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-21 02:22:16,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2022-07-21 02:22:16,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2022-07-21 02:22:16,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2022-07-21 02:22:16,687 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:22:16,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 02:22:16,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2022-07-21 02:22:16,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 02:22:16,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,835 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 63 treesize of output 54 [2022-07-21 02:22:16,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 46 [2022-07-21 02:22:16,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 27 [2022-07-21 02:22:16,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-07-21 02:22:16,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:16,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:16,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2022-07-21 02:22:16,886 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-07-21 02:22:16,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2022-07-21 02:22:17,096 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:22:17,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 152 [2022-07-21 02:22:17,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 38 [2022-07-21 02:22:17,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2022-07-21 02:22:17,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:17,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:22:17,298 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-21 02:22:17,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 114 treesize of output 62 [2022-07-21 02:22:17,308 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:22:17,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-07-21 02:22:17,315 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:22:17,316 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 28 treesize of output 16 [2022-07-21 02:22:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:22:17,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:22:17,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_924 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_927)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_926)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_924)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (+ (select .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_924))))))) is different from false [2022-07-21 02:22:17,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_924 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (not (<= (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_924)) (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_927)) (.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_926)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_924)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2022-07-21 02:22:17,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:17,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 660 treesize of output 528 [2022-07-21 02:22:17,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:17,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 516 treesize of output 498 [2022-07-21 02:22:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-21 02:22:17,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919876072] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:22:17,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:22:17,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2022-07-21 02:22:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712594223] [2022-07-21 02:22:17,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:22:17,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 02:22:17,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 02:22:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=368, Unknown=2, NotChecked=78, Total=506 [2022-07-21 02:22:17,806 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:24,339 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-07-21 02:22:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 02:22:24,340 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-21 02:22:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:24,340 INFO L225 Difference]: With dead ends: 31 [2022-07-21 02:22:24,340 INFO L226 Difference]: Without dead ends: 24 [2022-07-21 02:22:24,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=161, Invalid=657, Unknown=2, NotChecked=110, Total=930 [2022-07-21 02:22:24,341 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:22:24,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 112 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 84 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-07-21 02:22:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-21 02:22:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-07-21 02:22:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-21 02:22:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-07-21 02:22:24,347 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 19 [2022-07-21 02:22:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:24,347 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-07-21 02:22:24,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-07-21 02:22:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 02:22:24,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:24,348 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:24,372 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-21 02:22:24,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:24,568 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2096375286, now seen corresponding path program 1 times [2022-07-21 02:22:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:24,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569944555] [2022-07-21 02:22:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:22:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:25,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569944555] [2022-07-21 02:22:25,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569944555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:22:25,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550139210] [2022-07-21 02:22:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:25,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:25,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:22:25,036 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-21 02:22:25,037 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-21 02:22:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:25,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-21 02:22:25,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:22:25,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-21 02:22:25,221 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-21 02:22:25,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-07-21 02:22:25,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2022-07-21 02:22:25,261 INFO L356 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2022-07-21 02:22:25,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 88 [2022-07-21 02:22:25,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-21 02:22:25,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2022-07-21 02:22:25,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-07-21 02:22:25,410 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 0 case distinctions, treesize of input 50 treesize of output 36 [2022-07-21 02:22:25,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2022-07-21 02:22:25,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-21 02:22:25,453 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:22:25,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 02:22:25,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2022-07-21 02:22:25,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 02:22:25,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-21 02:22:25,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:22:25,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:22:25,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:25,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:25,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:25,639 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:22:25,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-07-21 02:22:25,918 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:22:25,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 149 [2022-07-21 02:22:25,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 54 [2022-07-21 02:22:25,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2022-07-21 02:22:26,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:22:26,207 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-21 02:22:26,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 191 treesize of output 107 [2022-07-21 02:22:26,218 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-21 02:22:26,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 58 [2022-07-21 02:22:26,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-07-21 02:22:26,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-21 02:22:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:22:26,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:22:36,448 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1111 Int) (v_ArrVal_1107 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse12))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_1108)) (.cse13 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse13)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_1109))) (let ((.cse1 (select (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse13)) (.cse9 (+ .cse2 4)) (.cse5 (select |c_#memory_int| .cse11)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse12))) (let ((.cse0 (store |c_#memory_int| .cse11 (store .cse5 .cse6 v_ArrVal_1107))) (.cse7 (select (select .cse10 .cse1) .cse9))) (let ((.cse3 (select .cse0 .cse7)) (.cse4 (select (select .cse8 .cse1) .cse9))) (or (not (<= (+ (select (select .cse0 .cse1) .cse2) v_ArrVal_1111) (select .cse3 .cse4))) (not (<= v_ArrVal_1107 (+ (select .cse5 .cse6) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (<= (select (select (store .cse0 .cse7 (store .cse3 .cse4 v_ArrVal_1111)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)))))))))) is different from false [2022-07-21 02:22:36,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1111 Int) (v_ArrVal_1107 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_1108)) (.cse13 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_1109))) (let ((.cse1 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse9 (+ .cse2 4)) (.cse6 (select |c_#memory_int| .cse11)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse0 (store |c_#memory_int| .cse11 (store .cse6 .cse7 v_ArrVal_1107))) (.cse5 (select (select .cse10 .cse1) .cse9))) (let ((.cse3 (select .cse0 .cse5)) (.cse4 (select (select .cse8 .cse1) .cse9))) (or (not (<= (+ v_ArrVal_1111 (select (select .cse0 .cse1) .cse2)) (select .cse3 .cse4))) (<= (select (select (store .cse0 .cse5 (store .cse3 .cse4 v_ArrVal_1111)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (not (<= v_ArrVal_1107 (+ (select .cse6 .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))) is different from false [2022-07-21 02:22:36,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:36,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1929 treesize of output 1731 [2022-07-21 02:22:36,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:36,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1719 treesize of output 1575 [2022-07-21 02:22:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-21 02:22:37,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550139210] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:22:37,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:22:37,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 24 [2022-07-21 02:22:37,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422276461] [2022-07-21 02:22:37,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:22:37,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 02:22:37,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:22:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 02:22:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=369, Unknown=7, NotChecked=82, Total=552 [2022-07-21 02:22:37,293 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:22:52,002 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-21 02:22:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 02:22:52,003 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-21 02:22:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:22:52,003 INFO L225 Difference]: With dead ends: 40 [2022-07-21 02:22:52,004 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 02:22:52,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=193, Invalid=674, Unknown=11, NotChecked=114, Total=992 [2022-07-21 02:22:52,005 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:22:52,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 112 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2022-07-21 02:22:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 02:22:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-21 02:22:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-21 02:22:52,009 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2022-07-21 02:22:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:22:52,010 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-21 02:22:52,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:22:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-21 02:22:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 02:22:52,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:22:52,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:22:52,030 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-21 02:22:52,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:52,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:22:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:22:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2096373364, now seen corresponding path program 1 times [2022-07-21 02:22:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:22:52,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356557203] [2022-07-21 02:22:52,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:52,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:22:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:22:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:22:52,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356557203] [2022-07-21 02:22:52,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356557203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:22:52,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597959786] [2022-07-21 02:22:52,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:22:52,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:22:52,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:22:52,573 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-21 02:22:52,574 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-21 02:22:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:22:52,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-21 02:22:52,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:22:52,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:52,714 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 18 treesize of output 19 [2022-07-21 02:22:52,727 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:22:52,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-21 02:22:52,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:52,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:52,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-07-21 02:22:52,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-07-21 02:22:52,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-21 02:22:52,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:52,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:52,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-21 02:22:52,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15 [2022-07-21 02:22:52,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:52,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-21 02:22:52,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:22:52,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-21 02:22:52,884 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-21 02:22:52,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-07-21 02:22:52,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-21 02:22:53,085 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-21 02:22:53,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 105 [2022-07-21 02:22:53,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-07-21 02:22:53,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-21 02:22:53,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:22:53,323 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-21 02:22:53,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 205 treesize of output 103 [2022-07-21 02:22:53,334 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:22:53,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 46 [2022-07-21 02:22:53,345 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 39 treesize of output 26 [2022-07-21 02:22:53,389 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:22:53,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2022-07-21 02:22:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:22:53,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:22:57,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1279)) (.cse11 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1280))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse0 (store |c_#memory_int| .cse10 v_ArrVal_1281)) (.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (<= 91 (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_1283)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (<= .cse4 100) (not (<= .cse4 (+ v_ArrVal_1283 (select (select .cse0 .cse5) .cse6))))))))))))) is different from false [2022-07-21 02:22:57,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1279)) (.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1280))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ 4 .cse3))) (let ((.cse1 (store |c_#memory_int| .cse10 v_ArrVal_1281)) (.cse4 (select (select .cse9 .cse2) .cse8))) (let ((.cse5 (select .cse1 .cse4)) (.cse6 (select (select .cse7 .cse2) .cse8))) (let ((.cse0 (select .cse5 .cse6))) (or (not (<= .cse0 (+ (select (select .cse1 .cse2) .cse3) v_ArrVal_1283))) (<= .cse0 100) (<= 91 (select (select (store .cse1 .cse4 (store .cse5 .cse6 v_ArrVal_1283)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))))))) is different from false [2022-07-21 02:22:57,715 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:57,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1896 treesize of output 1428 [2022-07-21 02:22:57,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:57,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1416 treesize of output 1370 [2022-07-21 02:22:57,801 INFO L356 Elim1Store]: treesize reduction 16, result has 66.7 percent of original size [2022-07-21 02:22:57,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2631 treesize of output 2398 [2022-07-21 02:22:59,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:22:59,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32680 treesize of output 31561 [2022-07-21 02:23:00,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:00,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 601998 treesize of output 546740 [2022-07-21 02:23:01,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:01,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 544860 treesize of output 523338 [2022-07-21 02:23:02,755 INFO L244 Elim1Store]: Index analysis took 246 ms [2022-07-21 02:23:15,300 WARN L233 SmtUtils]: Spent 12.53s on a formula simplification that was a NOOP. DAG size: 741 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-21 02:23:15,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:15,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 522505 treesize of output 522268 [2022-07-21 02:23:20,726 INFO L244 Elim1Store]: Index analysis took 3149 ms [2022-07-21 02:23:34,926 WARN L233 SmtUtils]: Spent 14.18s on a formula simplification that was a NOOP. DAG size: 741 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-21 02:23:34,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:34,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 528028 treesize of output 523850 [2022-07-21 02:23:40,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:40,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 358378 treesize of output 354430 [2022-07-21 02:23:48,601 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 4445 DAG size of output: 4441 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)