./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/process_queue.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/process_queue.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 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:21:27,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:21:27,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:21:27,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:21:27,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:21:27,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:21:27,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:21:27,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:21:27,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:21:27,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:21:27,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:21:27,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:21:27,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:21:27,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:21:27,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:21:27,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:21:27,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:21:27,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:21:27,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:21:27,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:21:27,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:21:27,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:21:27,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:21:27,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:21:27,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:21:27,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:21:27,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:21:27,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:21:27,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:21:27,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:21:27,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:21:27,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:21:27,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:21:27,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:21:27,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:21:27,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:21:27,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:21:27,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:21:27,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:21:27,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:21:27,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:21:27,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:21:27,921 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:21:27,942 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:21:27,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:21:27,948 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:21:27,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:21:27,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:21:27,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:21:27,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:21:27,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:21:27,950 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:21:27,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:21:27,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:21:27,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:21:27,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:21:27,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:21:27,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:21:27,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:21:27,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:21:27,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:21:27,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:21:27,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:21:27,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:21:27,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:21:27,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:21:27,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:21:27,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:21:27,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:21:27,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:21:27,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:21:27,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:21:27,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:21:27,954 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:21:27,955 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:21:27,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:21:27,955 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 -> 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c [2022-07-21 02:21:28,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:21:28,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:21:28,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:21:28,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:21:28,259 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:21:28,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/process_queue.i [2022-07-21 02:21:28,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445c4cd4b/877fb00ec8e84d2a903918ee9453c767/FLAGf195a52b4 [2022-07-21 02:21:28,691 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:21:28,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i [2022-07-21 02:21:28,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445c4cd4b/877fb00ec8e84d2a903918ee9453c767/FLAGf195a52b4 [2022-07-21 02:21:28,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445c4cd4b/877fb00ec8e84d2a903918ee9453c767 [2022-07-21 02:21:28,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:21:28,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:21:28,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:21:28,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:21:28,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:21:28,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:21:28" (1/1) ... [2022-07-21 02:21:28,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342a7a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:28, skipping insertion in model container [2022-07-21 02:21:28,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:21:28" (1/1) ... [2022-07-21 02:21:28,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:21:28,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:21:28,946 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/process_queue.i[23979,23992] [2022-07-21 02:21:28,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:21:28,968 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:21:29,019 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/process_queue.i[23979,23992] [2022-07-21 02:21:29,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:21:29,046 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:21:29,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29 WrapperNode [2022-07-21 02:21:29,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:21:29,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:21:29,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:21:29,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:21:29,052 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:21:29" (1/1) ... [2022-07-21 02:21:29,070 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:21:29" (1/1) ... [2022-07-21 02:21:29,091 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-07-21 02:21:29,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:21:29,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:21:29,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:21:29,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:21:29,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (1/1) ... [2022-07-21 02:21:29,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (1/1) ... [2022-07-21 02:21:29,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (1/1) ... [2022-07-21 02:21:29,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (1/1) ... [2022-07-21 02:21:29,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (1/1) ... [2022-07-21 02:21:29,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (1/1) ... [2022-07-21 02:21:29,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (1/1) ... [2022-07-21 02:21:29,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:21:29,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:21:29,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:21:29,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:21:29,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (1/1) ... [2022-07-21 02:21:29,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:21:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:29,138 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:21:29,142 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:21:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:21:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:21:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:21:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:21:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:21:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:21:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:21:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:21:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:21:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:21:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:21:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:21:29,271 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:21:29,272 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:21:29,456 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:21:29,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:21:29,461 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 02:21:29,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:21:29 BoogieIcfgContainer [2022-07-21 02:21:29,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:21:29,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:21:29,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:21:29,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:21:29,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:21:28" (1/3) ... [2022-07-21 02:21:29,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9b8fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:21:29, skipping insertion in model container [2022-07-21 02:21:29,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:21:29" (2/3) ... [2022-07-21 02:21:29,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9b8fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:21:29, skipping insertion in model container [2022-07-21 02:21:29,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:21:29" (3/3) ... [2022-07-21 02:21:29,468 INFO L111 eAbstractionObserver]: Analyzing ICFG process_queue.i [2022-07-21 02:21:29,477 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:21:29,478 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:21:29,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:21:29,516 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@1c9aa942, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ef40070 [2022-07-21 02:21:29,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:21:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 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:21:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 02:21:29,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:29,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:29,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2022-07-21 02:21:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:29,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087210493] [2022-07-21 02:21:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:29,751 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:21:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:29,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087210493] [2022-07-21 02:21:29,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087210493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:21:29,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:21:29,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:21:29,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481608592] [2022-07-21 02:21:29,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:21:29,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:21:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:21:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:21:29,791 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:21:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:29,822 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-07-21 02:21:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:21:29,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:21:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:29,832 INFO L225 Difference]: With dead ends: 51 [2022-07-21 02:21:29,832 INFO L226 Difference]: Without dead ends: 23 [2022-07-21 02:21:29,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:21:29,838 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:29,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:21:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-21 02:21:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-21 02:21:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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:21:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-07-21 02:21:29,864 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-07-21 02:21:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:29,864 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-21 02:21:29,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:21:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-07-21 02:21:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 02:21:29,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:29,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:29,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:21:29,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:29,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2022-07-21 02:21:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:29,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90702835] [2022-07-21 02:21:29,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:29,927 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:21:29,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:29,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90702835] [2022-07-21 02:21:29,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90702835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:21:29,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:21:29,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:21:29,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824097714] [2022-07-21 02:21:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:21:29,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:21:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:29,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:21:29,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:21:29,932 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:29,989 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-07-21 02:21:29,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:21:29,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 02:21:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:29,990 INFO L225 Difference]: With dead ends: 56 [2022-07-21 02:21:29,990 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:21:29,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:21:29,994 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:29,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:21:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:21:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-07-21 02:21:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:21:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-21 02:21:30,007 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2022-07-21 02:21:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:30,008 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-21 02:21:30,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-07-21 02:21:30,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 02:21:30,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:30,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:30,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:21:30,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2022-07-21 02:21:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:30,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188072665] [2022-07-21 02:21:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:30,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:30,187 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:21:30,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:30,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188072665] [2022-07-21 02:21:30,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188072665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:21:30,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:21:30,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:21:30,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765109165] [2022-07-21 02:21:30,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:21:30,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:21:30,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:30,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:21:30,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:21:30,190 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:21:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:30,355 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-07-21 02:21:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:21:30,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:21:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:30,358 INFO L225 Difference]: With dead ends: 74 [2022-07-21 02:21:30,358 INFO L226 Difference]: Without dead ends: 72 [2022-07-21 02:21:30,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:21:30,359 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:30,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:21:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-21 02:21:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-07-21 02:21:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:21:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-07-21 02:21:30,366 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2022-07-21 02:21:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:30,366 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-07-21 02:21:30,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:21:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-07-21 02:21:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 02:21:30,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:30,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:30,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:21:30,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2022-07-21 02:21:30,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:30,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935127701] [2022-07-21 02:21:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:30,419 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:21:30,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:30,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935127701] [2022-07-21 02:21:30,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935127701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:21:30,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:21:30,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:21:30,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489956810] [2022-07-21 02:21:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:21:30,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:21:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:21:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:21:30,424 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:30,489 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-07-21 02:21:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 02:21:30,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 02:21:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:30,490 INFO L225 Difference]: With dead ends: 106 [2022-07-21 02:21:30,490 INFO L226 Difference]: Without dead ends: 57 [2022-07-21 02:21:30,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:21:30,497 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:30,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:21:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-21 02:21:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-07-21 02:21:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-07-21 02:21:30,508 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2022-07-21 02:21:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:30,509 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-07-21 02:21:30,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-07-21 02:21:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 02:21:30,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:30,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:30,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 02:21:30,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:30,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2022-07-21 02:21:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:30,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115335899] [2022-07-21 02:21:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:30,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115335899] [2022-07-21 02:21:30,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115335899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:30,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928581733] [2022-07-21 02:21:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:30,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:30,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:30,618 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:21:30,620 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:21:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:30,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-21 02:21:30,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:30,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:21:30,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:30,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:30,943 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 31 treesize of output 26 [2022-07-21 02:21:30,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:30,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:30,955 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 31 treesize of output 26 [2022-07-21 02:21:30,964 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 0 case distinctions, treesize of input 26 treesize of output 21 [2022-07-21 02:21:30,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16 treesize of output 15 [2022-07-21 02:21:30,981 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 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-21 02:21:30,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-21 02:21:30,999 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 02:21:31,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 02:21:31,119 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-21 02:21:31,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2022-07-21 02:21:31,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-07-21 02:21:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:31,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:31,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928581733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:31,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:31,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-21 02:21:31,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811346944] [2022-07-21 02:21:31,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:31,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 02:21:31,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 02:21:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 02:21:31,327 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 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:21:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:31,484 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2022-07-21 02:21:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 02:21:31,487 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 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) Word has length 14 [2022-07-21 02:21:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:31,487 INFO L225 Difference]: With dead ends: 121 [2022-07-21 02:21:31,487 INFO L226 Difference]: Without dead ends: 83 [2022-07-21 02:21:31,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-21 02:21:31,488 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:31,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-07-21 02:21:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-21 02:21:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2022-07-21 02:21:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2022-07-21 02:21:31,494 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2022-07-21 02:21:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:31,494 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2022-07-21 02:21:31,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 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:21:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2022-07-21 02:21:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 02:21:31,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:31,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:31,515 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:21:31,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:31,712 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2022-07-21 02:21:31,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:31,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601348927] [2022-07-21 02:21:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:31,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601348927] [2022-07-21 02:21:31,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601348927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:21:31,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:21:31,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:21:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462853038] [2022-07-21 02:21:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:21:31,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:21:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:31,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:21:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:21:31,767 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:31,806 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2022-07-21 02:21:31,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:21:31,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-21 02:21:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:31,807 INFO L225 Difference]: With dead ends: 117 [2022-07-21 02:21:31,807 INFO L226 Difference]: Without dead ends: 79 [2022-07-21 02:21:31,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:21:31,808 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:31,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:21:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-21 02:21:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-07-21 02:21:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-07-21 02:21:31,820 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2022-07-21 02:21:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:31,820 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-07-21 02:21:31,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-07-21 02:21:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 02:21:31,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:31,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:31,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 02:21:31,821 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2022-07-21 02:21:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:31,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770699100] [2022-07-21 02:21:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:21:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:31,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770699100] [2022-07-21 02:21:31,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770699100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:31,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327262886] [2022-07-21 02:21:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:31,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:31,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:31,926 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:21:31,927 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:21:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:32,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-21 02:21:32,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:32,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:21:32,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:32,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:32,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-21 02:21:32,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:32,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:32,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-21 02:21:32,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:32,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:32,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:21:32,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:32,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:21:32,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-21 02:21:32,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:21:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:21:32,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:32,386 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:32,386 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 24 treesize of output 35 [2022-07-21 02:21:32,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-21 02:21:32,393 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 9 treesize of output 7 [2022-07-21 02:21:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:21:32,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327262886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:32,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:32,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-21 02:21:32,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808190042] [2022-07-21 02:21:32,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:32,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 02:21:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 02:21:32,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-21 02:21:32,479 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:21:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:33,122 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2022-07-21 02:21:33,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 02:21:33,122 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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 22 [2022-07-21 02:21:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:33,123 INFO L225 Difference]: With dead ends: 252 [2022-07-21 02:21:33,123 INFO L226 Difference]: Without dead ends: 198 [2022-07-21 02:21:33,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 02:21:33,124 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 209 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:33,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 340 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 02:21:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-21 02:21:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 91. [2022-07-21 02:21:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:21:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-21 02:21:33,131 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 22 [2022-07-21 02:21:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:33,131 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-21 02:21:33,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:21:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-21 02:21:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:21:33,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:33,132 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:33,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 02:21:33,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-21 02:21:33,349 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2022-07-21 02:21:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:33,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481475764] [2022-07-21 02:21:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:33,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:33,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481475764] [2022-07-21 02:21:33,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481475764] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:33,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748755169] [2022-07-21 02:21:33,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:21:33,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:33,637 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:21:33,671 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:21:33,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:21:33,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:21:33,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-21 02:21:33,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:33,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:21:33,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:33,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:33,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-21 02:21:33,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:33,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:33,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-21 02:21:33,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:33,838 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-21 02:21:33,839 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 25 treesize of output 29 [2022-07-21 02:21:33,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:34,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,063 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 46 treesize of output 39 [2022-07-21 02:21:34,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2022-07-21 02:21:34,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,077 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 23 treesize of output 27 [2022-07-21 02:21:34,082 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 0 case distinctions, treesize of input 45 treesize of output 36 [2022-07-21 02:21:34,085 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 0 case distinctions, treesize of input 39 treesize of output 32 [2022-07-21 02:21:34,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 11 [2022-07-21 02:21:34,095 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 12 treesize of output 11 [2022-07-21 02:21:34,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,103 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-21 02:21:34,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-21 02:21:34,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:34,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2022-07-21 02:21:34,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,250 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:21:34,250 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 28 treesize of output 18 [2022-07-21 02:21:34,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:21:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:34,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:34,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_525 Int)) (or (<= 1 (select (select (store (store |c_#memory_int| v_ArrVal_525 v_ArrVal_512) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_515) (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_525) 8)))) (not (< v_ArrVal_525 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_525) 0)))) is different from false [2022-07-21 02:21:34,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:34,497 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 377 treesize of output 380 [2022-07-21 02:21:34,515 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 168 treesize of output 136 [2022-07-21 02:21:34,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 210 [2022-07-21 02:21:34,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_525 Int)) (or (and (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#queue~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8)))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_525) 8)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (not (= v_ArrVal_525 (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8))))) (not (< v_ArrVal_525 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_525) 0)))) is different from false [2022-07-21 02:21:34,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,786 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 104 treesize of output 102 [2022-07-21 02:21:34,790 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 54 treesize of output 52 [2022-07-21 02:21:34,794 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 53 treesize of output 51 [2022-07-21 02:21:34,799 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 52 treesize of output 50 [2022-07-21 02:21:34,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-21 02:21:34,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2022-07-21 02:21:34,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (v_ArrVal_506 (Array Int Int)) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~new_process~0#1.base_9| Int) (v_ArrVal_525 Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~new_process~0#1.base_9| 1) v_ArrVal_525) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~new_process~0#1.base_9|) 0)) (not (< v_ArrVal_525 |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (not (= v_ArrVal_525 (select (select (let ((.cse0 (store (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_506) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_508) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_9|)))) (store (store .cse0 v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store .cse0 v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse0 v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525))) v_ArrVal_525) 8)))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (= |v_ULTIMATE.start_main_~new_process~0#1.base_9| (select (select (let ((.cse1 (store (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_506) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_508) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_9|)))) (store (store .cse1 v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store .cse1 v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525))) v_ArrVal_525) 8))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_519 (Array Int Int))) (not (= (select (select (let ((.cse2 (store (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_506) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_508) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_9|)))) (store (store .cse2 v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store .cse2 v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse2 v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525))) v_ArrVal_525) 8) |c_ULTIMATE.start_main_~#queue~0#1.base|))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (+ (select (select (let ((.cse3 (store (store |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_505) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~new_process~0#1.base_9| v_ArrVal_507) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse3 v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store .cse3 v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse3 v_ArrVal_525 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_525) 8) 4) 4))))) is different from false [2022-07-21 02:21:34,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,893 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 104 treesize of output 102 [2022-07-21 02:21:34,897 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 54 treesize of output 52 [2022-07-21 02:21:34,901 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 53 treesize of output 51 [2022-07-21 02:21:34,905 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 52 treesize of output 50 [2022-07-21 02:21:34,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-21 02:21:34,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,920 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 109 treesize of output 107 [2022-07-21 02:21:34,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:34,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:34,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,001 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 104 treesize of output 102 [2022-07-21 02:21:35,010 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 54 treesize of output 52 [2022-07-21 02:21:35,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-07-21 02:21:35,020 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 52 treesize of output 50 [2022-07-21 02:21:35,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-21 02:21:35,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2022-07-21 02:21:35,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:35,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2022-07-21 02:21:35,126 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 54 treesize of output 52 [2022-07-21 02:21:35,131 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 53 treesize of output 51 [2022-07-21 02:21:35,136 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 52 treesize of output 50 [2022-07-21 02:21:35,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-21 02:21:35,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,149 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 109 treesize of output 107 [2022-07-21 02:21:35,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:35,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-21 02:21:35,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748755169] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:35,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:35,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-07-21 02:21:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780880293] [2022-07-21 02:21:35,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:35,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 02:21:35,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:35,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 02:21:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=466, Unknown=4, NotChecked=138, Total=702 [2022-07-21 02:21:35,223 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:21:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:36,015 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2022-07-21 02:21:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 02:21:36,015 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-21 02:21:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:36,016 INFO L225 Difference]: With dead ends: 173 [2022-07-21 02:21:36,016 INFO L226 Difference]: Without dead ends: 171 [2022-07-21 02:21:36,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=827, Unknown=5, NotChecked=192, Total=1260 [2022-07-21 02:21:36,017 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:36,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 382 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 234 Invalid, 0 Unknown, 247 Unchecked, 0.3s Time] [2022-07-21 02:21:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-21 02:21:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 148. [2022-07-21 02:21:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 147 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2022-07-21 02:21:36,028 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 25 [2022-07-21 02:21:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:36,028 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2022-07-21 02:21:36,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:21:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2022-07-21 02:21:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 02:21:36,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:36,029 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:36,062 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:21:36,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:36,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2022-07-21 02:21:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819932191] [2022-07-21 02:21:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:36,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:36,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819932191] [2022-07-21 02:21:36,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819932191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:36,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416515845] [2022-07-21 02:21:36,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 02:21:36,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:36,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:36,463 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:21:36,464 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:21:36,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 02:21:36,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:21:36,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-21 02:21:36,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:36,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:36,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:36,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-21 02:21:36,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:36,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:36,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-21 02:21:36,866 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 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-21 02:21:36,870 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 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-21 02:21:36,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10 treesize of output 9 [2022-07-21 02:21:36,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 11 [2022-07-21 02:21:36,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 11 [2022-07-21 02:21:37,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:37,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:37,047 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-21 02:21:37,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2022-07-21 02:21:37,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:37,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:37,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:37,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:37,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-21 02:21:37,062 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 0 case distinctions, treesize of input 51 treesize of output 40 [2022-07-21 02:21:37,067 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:21:37,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 11 [2022-07-21 02:21:37,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 11 [2022-07-21 02:21:37,080 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-21 02:21:37,080 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 23 treesize of output 23 [2022-07-21 02:21:37,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:37,374 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-21 02:21:37,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 84 [2022-07-21 02:21:37,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:37,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:37,390 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-21 02:21:37,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-07-21 02:21:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:21:37,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:37,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 02:21:38,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 Int) (v_ArrVal_691 Int)) (or (not (< v_ArrVal_691 |c_#StackHeapBarrier|)) (= v_ArrVal_691 v_ArrVal_663) (not (< v_ArrVal_663 |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse3 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse3 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse3 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (select (select .cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse1 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse1 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))) v_ArrVal_691) 8)) (+ (select (select .cse0 v_ArrVal_691) 8) 8))) 0)) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse5 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse5 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))))) (select .cse4 (select (select .cse4 v_ArrVal_691) 8))) (+ (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse7 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse7 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse7 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_691) 8) 8)) 0))))) is different from false [2022-07-21 02:21:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-21 02:21:39,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416515845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:39,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:39,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-21 02:21:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264241856] [2022-07-21 02:21:39,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:39,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 02:21:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 02:21:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-07-21 02:21:39,307 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:21:41,319 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#queue~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_663 Int) (v_ArrVal_691 Int)) (or (not (< v_ArrVal_691 |c_#StackHeapBarrier|)) (= v_ArrVal_691 v_ArrVal_663) (not (< v_ArrVal_663 |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= (let ((.cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse3 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse3 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse3 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (select (select .cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse1 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse1 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))) v_ArrVal_691) 8)) (+ (select (select .cse0 v_ArrVal_691) 8) 8))) 0)) (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (= (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse5 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse5 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))))) (select .cse4 (select (select .cse4 v_ArrVal_691) 8))) (+ (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse7 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse7 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse7 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_691) 8) 8)) 0))))) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)) is different from false [2022-07-21 02:21:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:41,860 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions. [2022-07-21 02:21:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 02:21:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-21 02:21:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:41,861 INFO L225 Difference]: With dead ends: 363 [2022-07-21 02:21:41,861 INFO L226 Difference]: Without dead ends: 241 [2022-07-21 02:21:41,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=111, Invalid=597, Unknown=2, NotChecked=102, Total=812 [2022-07-21 02:21:41,862 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 118 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:41,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 380 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 172 Invalid, 0 Unknown, 124 Unchecked, 0.2s Time] [2022-07-21 02:21:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-21 02:21:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 192. [2022-07-21 02:21:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.2722513089005236) internal successors, (243), 191 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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:21:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 243 transitions. [2022-07-21 02:21:41,876 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 243 transitions. Word has length 28 [2022-07-21 02:21:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:41,877 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 243 transitions. [2022-07-21 02:21:41,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:21:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 243 transitions. [2022-07-21 02:21:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 02:21:41,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:41,878 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:41,896 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:21:42,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:42,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2022-07-21 02:21:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:42,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878509241] [2022-07-21 02:21:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:21:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:42,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878509241] [2022-07-21 02:21:42,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878509241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:42,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536951690] [2022-07-21 02:21:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:42,125 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:21:42,126 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:21:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:42,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:21:42,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:21:42,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 02:21:42,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536951690] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:42,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:42,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-21 02:21:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7581419] [2022-07-21 02:21:42,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:42,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 02:21:42,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:42,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 02:21:42,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:21:42,267 INFO L87 Difference]: Start difference. First operand 192 states and 243 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:21:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:42,393 INFO L93 Difference]: Finished difference Result 637 states and 823 transitions. [2022-07-21 02:21:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 02:21:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 02:21:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:42,397 INFO L225 Difference]: With dead ends: 637 [2022-07-21 02:21:42,397 INFO L226 Difference]: Without dead ends: 471 [2022-07-21 02:21:42,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-21 02:21:42,400 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 82 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:42,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:21:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-07-21 02:21:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 400. [2022-07-21 02:21:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.2531328320802004) internal successors, (500), 399 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:21:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 500 transitions. [2022-07-21 02:21:42,428 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 500 transitions. Word has length 29 [2022-07-21 02:21:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:42,428 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 500 transitions. [2022-07-21 02:21:42,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:21:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 500 transitions. [2022-07-21 02:21:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 02:21:42,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:42,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:42,450 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:21:42,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 02:21:42,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2022-07-21 02:21:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:42,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044093841] [2022-07-21 02:21:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044093841] [2022-07-21 02:21:42,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044093841] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822704620] [2022-07-21 02:21:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:42,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:42,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:42,872 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:21:42,874 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:21:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:42,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-21 02:21:42,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:42,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:21:43,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:43,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:43,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-21 02:21:43,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:43,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:43,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-21 02:21:43,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:43,023 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 02:21:43,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 02:21:43,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:43,251 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:21:43,251 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 108 treesize of output 99 [2022-07-21 02:21:43,255 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 80 treesize of output 30 [2022-07-21 02:21:43,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-21 02:21:43,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-21 02:21:43,314 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 28 treesize of output 16 [2022-07-21 02:21:43,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:21:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:43,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:43,394 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_choose_next_#t~mem5#1| 1) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_863 Int) (v_ArrVal_864 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base| (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))))))) is different from false [2022-07-21 02:21:43,404 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4)) 1) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_863 Int) (v_ArrVal_864 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base| (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))))))) is different from false [2022-07-21 02:21:43,415 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4)) 1) (forall ((v_ArrVal_863 Int) (v_ArrVal_865 (Array Int Int)) (v_ArrVal_864 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4)))))))) is different from false [2022-07-21 02:21:43,547 INFO L356 Elim1Store]: treesize reduction 16, result has 84.9 percent of original size [2022-07-21 02:21:43,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 193 [2022-07-21 02:21:43,726 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_check_queue_~n~0#1.offset|)) (forall ((v_ArrVal_865 (Array Int Int))) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))) is different from false [2022-07-21 02:21:43,732 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (forall ((v_ArrVal_865 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) .cse0)))) is different from false [2022-07-21 02:21:43,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:21:43,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-21 02:21:43,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822704620] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:43,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:43,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2022-07-21 02:21:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570267297] [2022-07-21 02:21:43,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:43,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-21 02:21:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-21 02:21:43,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=526, Unknown=5, NotChecked=250, Total=870 [2022-07-21 02:21:43,766 INFO L87 Difference]: Start difference. First operand 400 states and 500 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:44,516 INFO L93 Difference]: Finished difference Result 601 states and 758 transitions. [2022-07-21 02:21:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:21:44,520 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-21 02:21:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:44,521 INFO L225 Difference]: With dead ends: 601 [2022-07-21 02:21:44,521 INFO L226 Difference]: Without dead ends: 446 [2022-07-21 02:21:44,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1053, Unknown=9, NotChecked=360, Total=1640 [2022-07-21 02:21:44,523 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:44,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 330 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 232 Invalid, 0 Unknown, 190 Unchecked, 0.2s Time] [2022-07-21 02:21:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-07-21 02:21:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 415. [2022-07-21 02:21:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.2536231884057971) internal successors, (519), 414 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:21:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 519 transitions. [2022-07-21 02:21:44,551 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 519 transitions. Word has length 29 [2022-07-21 02:21:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:44,551 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 519 transitions. [2022-07-21 02:21:44,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 519 transitions. [2022-07-21 02:21:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 02:21:44,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:44,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:44,571 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:21:44,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:44,763 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:44,763 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2022-07-21 02:21:44,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:44,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398061477] [2022-07-21 02:21:44,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:44,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:44,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398061477] [2022-07-21 02:21:44,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398061477] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276869533] [2022-07-21 02:21:44,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:44,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:44,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:44,870 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:21:44,871 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:21:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:44,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-21 02:21:44,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:44,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:21:44,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:45,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:45,001 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 21 treesize of output 25 [2022-07-21 02:21:45,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:45,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:45,007 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 21 treesize of output 25 [2022-07-21 02:21:45,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10 treesize of output 9 [2022-07-21 02:21:45,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 02:21:45,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:21:45,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:21:45,036 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 02:21:45,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 02:21:45,136 INFO L356 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2022-07-21 02:21:45,137 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 25 treesize of output 34 [2022-07-21 02:21:45,154 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-07-21 02:21:45,154 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 33 treesize of output 24 [2022-07-21 02:21:45,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-07-21 02:21:45,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-07-21 02:21:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:21:45,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:21:45,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276869533] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:45,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:45,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 19 [2022-07-21 02:21:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218747183] [2022-07-21 02:21:45,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:45,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 02:21:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 02:21:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-21 02:21:45,393 INFO L87 Difference]: Start difference. First operand 415 states and 519 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:47,034 INFO L93 Difference]: Finished difference Result 1389 states and 1808 transitions. [2022-07-21 02:21:47,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-21 02:21:47,034 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-21 02:21:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:47,037 INFO L225 Difference]: With dead ends: 1389 [2022-07-21 02:21:47,037 INFO L226 Difference]: Without dead ends: 975 [2022-07-21 02:21:47,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=2562, Unknown=0, NotChecked=0, Total=3192 [2022-07-21 02:21:47,039 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 387 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:47,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 770 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 479 Invalid, 0 Unknown, 115 Unchecked, 0.7s Time] [2022-07-21 02:21:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-07-21 02:21:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 616. [2022-07-21 02:21:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 1.305691056910569) internal successors, (803), 615 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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:21:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 803 transitions. [2022-07-21 02:21:47,067 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 803 transitions. Word has length 30 [2022-07-21 02:21:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:47,068 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 803 transitions. [2022-07-21 02:21:47,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 803 transitions. [2022-07-21 02:21:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 02:21:47,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:47,069 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:47,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 02:21:47,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:47,271 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2022-07-21 02:21:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:47,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167428581] [2022-07-21 02:21:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:21:47,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:47,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167428581] [2022-07-21 02:21:47,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167428581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:21:47,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:21:47,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:21:47,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028579609] [2022-07-21 02:21:47,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:21:47,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:21:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:47,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:21:47,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:21:47,304 INFO L87 Difference]: Start difference. First operand 616 states and 803 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:47,339 INFO L93 Difference]: Finished difference Result 1302 states and 1699 transitions. [2022-07-21 02:21:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:21:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-21 02:21:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:47,342 INFO L225 Difference]: With dead ends: 1302 [2022-07-21 02:21:47,342 INFO L226 Difference]: Without dead ends: 802 [2022-07-21 02:21:47,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:21:47,344 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:47,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:21:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-21 02:21:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 589. [2022-07-21 02:21:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.2942176870748299) internal successors, (761), 588 states have internal predecessors, (761), 0 states have call successors, (0), 0 states 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:21:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 761 transitions. [2022-07-21 02:21:47,373 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 761 transitions. Word has length 30 [2022-07-21 02:21:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:47,373 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 761 transitions. [2022-07-21 02:21:47,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 761 transitions. [2022-07-21 02:21:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 02:21:47,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:47,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:47,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 02:21:47,374 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2022-07-21 02:21:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:47,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477910913] [2022-07-21 02:21:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:47,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477910913] [2022-07-21 02:21:47,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477910913] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:47,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294635092] [2022-07-21 02:21:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:47,524 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:21:47,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 02:21:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:47,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-21 02:21:47,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:47,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:21:47,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:47,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:47,673 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 21 treesize of output 25 [2022-07-21 02:21:47,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:47,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:47,678 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 21 treesize of output 25 [2022-07-21 02:21:47,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:47,689 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 22 treesize of output 22 [2022-07-21 02:21:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 02:21:47,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:47,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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:21:47,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:21:47,706 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 02:21:47,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 02:21:47,878 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:21:47,878 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 56 treesize of output 53 [2022-07-21 02:21:47,882 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 42 treesize of output 34 [2022-07-21 02:21:47,884 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 40 treesize of output 36 [2022-07-21 02:21:47,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-07-21 02:21:47,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 02:21:47,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 02:21:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:21:47,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:47,904 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1105 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1105) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1104) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0))) is different from false [2022-07-21 02:21:47,915 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1105 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1105) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)))) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1104) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)) 0))) is different from false [2022-07-21 02:21:48,057 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-21 02:21:48,057 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 87 treesize of output 70 [2022-07-21 02:21:48,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:48,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2022-07-21 02:21:48,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:48,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:48,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-21 02:21:48,079 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 122 treesize of output 114 [2022-07-21 02:21:48,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:48,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 95 [2022-07-21 02:21:48,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2022-07-21 02:21:48,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-21 02:21:48,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:48,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2022-07-21 02:21:48,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:48,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:48,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 96 [2022-07-21 02:21:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-21 02:21:48,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294635092] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:48,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:48,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-07-21 02:21:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136844112] [2022-07-21 02:21:48,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:48,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 02:21:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:48,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 02:21:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=311, Unknown=2, NotChecked=74, Total=462 [2022-07-21 02:21:48,137 INFO L87 Difference]: Start difference. First operand 589 states and 761 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:49,390 INFO L93 Difference]: Finished difference Result 1914 states and 2478 transitions. [2022-07-21 02:21:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 02:21:49,391 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-21 02:21:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:49,394 INFO L225 Difference]: With dead ends: 1914 [2022-07-21 02:21:49,394 INFO L226 Difference]: Without dead ends: 1426 [2022-07-21 02:21:49,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=540, Invalid=1358, Unknown=2, NotChecked=170, Total=2070 [2022-07-21 02:21:49,396 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 355 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:49,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 615 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 339 Invalid, 0 Unknown, 345 Unchecked, 0.5s Time] [2022-07-21 02:21:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2022-07-21 02:21:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 927. [2022-07-21 02:21:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 926 states have (on average 1.2688984881209504) internal successors, (1175), 926 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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:21:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1175 transitions. [2022-07-21 02:21:49,444 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1175 transitions. Word has length 33 [2022-07-21 02:21:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:49,444 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1175 transitions. [2022-07-21 02:21:49,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:21:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1175 transitions. [2022-07-21 02:21:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 02:21:49,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:49,445 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:49,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:21:49,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 02:21:49,659 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:49,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:49,660 INFO L85 PathProgramCache]: Analyzing trace with hash -196846093, now seen corresponding path program 1 times [2022-07-21 02:21:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:49,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544479538] [2022-07-21 02:21:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 02:21:49,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:49,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544479538] [2022-07-21 02:21:49,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544479538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:49,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873168404] [2022-07-21 02:21:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:49,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:49,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:49,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:21:49,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 02:21:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:49,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 131 conjunts are in the unsatisfiable core [2022-07-21 02:21:49,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:49,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:21:50,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-21 02:21:50,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-21 02:21:50,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:50,091 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-21 02:21:50,091 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 25 treesize of output 29 [2022-07-21 02:21:50,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:50,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,342 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 48 treesize of output 41 [2022-07-21 02:21:50,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-07-21 02:21:50,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,354 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 23 treesize of output 27 [2022-07-21 02:21:50,360 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 0 case distinctions, treesize of input 39 treesize of output 32 [2022-07-21 02:21:50,364 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 16 treesize of output 15 [2022-07-21 02:21:50,368 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 0 case distinctions, treesize of input 46 treesize of output 37 [2022-07-21 02:21:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,376 INFO L356 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2022-07-21 02:21:50,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2022-07-21 02:21:50,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 17 [2022-07-21 02:21:50,488 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-21 02:21:50,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 53 [2022-07-21 02:21:50,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:50,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-07-21 02:21:50,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:21:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 02:21:50,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:50,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1266 Int) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1263 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1262 (Array Int Int)) (v_ArrVal_1260 (Array Int Int))) (or (not (< v_ArrVal_1266 |c_#StackHeapBarrier|)) (<= 1 (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (store (store |c_#memory_int| v_ArrVal_1266 v_ArrVal_1263) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1262) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_ArrVal_1266 (store v_ArrVal_1254 .cse1 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse1)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 (store v_ArrVal_1252 .cse1 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 v_ArrVal_1252) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 v_ArrVal_1260) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_13|)) v_ArrVal_1266) .cse1) 4)))) (not (= (select |c_#valid| v_ArrVal_1266) 0)))) is different from false [2022-07-21 02:21:50,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:50,742 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 505 treesize of output 508 [2022-07-21 02:21:50,747 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 414 treesize of output 342 [2022-07-21 02:21:50,752 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 188 treesize of output 152 [2022-07-21 02:21:51,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_161 Int) (v_ArrVal_1266 Int) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int))) (let ((.cse1 (let ((.cse4 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| v_ArrVal_1266 (store v_ArrVal_1254 .cse4 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse3 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse4)))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base|))) (or (not (< v_ArrVal_1266 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_1266) 0)) (and .cse0 (<= 1 v_arrayElimCell_161)) (and (not .cse0) (not (= v_ArrVal_1266 .cse1)) (forall ((v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1260 (Array Int Int))) (= (+ |c_ULTIMATE.start_check_queue_~n~0#1.offset| 4) (+ (let ((.cse2 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 (store v_ArrVal_1252 .cse2 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 v_ArrVal_1252) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1266 v_ArrVal_1260) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_13|)) v_ArrVal_1266) .cse2)) 4))) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| .cse1)))))) is different from false [2022-07-21 02:21:51,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,447 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 84 treesize of output 82 [2022-07-21 02:21:51,451 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 49 treesize of output 45 [2022-07-21 02:21:51,453 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 24 treesize of output 20 [2022-07-21 02:21:51,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_#memory_$Pointer$.offset_116| (Array Int (Array Int Int))) (v_ArrVal_1239 (Array Int Int)) (|v_ULTIMATE.start_main_~new_process~0#1.base_21| Int) (v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1266 Int) (|v_#memory_$Pointer$.base_116| (Array Int (Array Int Int))) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~new_process~0#1.base_21|) 0)) (and (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int))) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse0 (let ((.cse1 (store (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1243) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1240) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_21|)))) (store .cse1 v_ArrVal_1266 (store v_ArrVal_1254 .cse2 (select (select (store .cse1 v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse2)) v_ArrVal_1266))) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int))) (= (let ((.cse5 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse3 (let ((.cse4 (store (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1243) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1240) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_21|)))) (store .cse4 v_ArrVal_1266 (store v_ArrVal_1254 .cse5 (select (select (store .cse4 v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse3 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse5)) |v_ULTIMATE.start_main_~new_process~0#1.base_21|)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1260 (Array Int Int))) (= (+ (let ((.cse7 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse6 (store (store |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1239) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1246) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse6 v_ArrVal_1266 (store v_ArrVal_1252 .cse7 (select (select (store .cse6 v_ArrVal_1266 v_ArrVal_1252) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse6 v_ArrVal_1266 v_ArrVal_1260) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_append_to_queue_~n#1.offset_13|))) v_ArrVal_1266) .cse7)) 4) 4)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.offset_13| Int) (v_ArrVal_1254 (Array Int Int))) (not (= (let ((.cse10 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_13| 8))) (select (select (let ((.cse8 (let ((.cse9 (store (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1243) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |v_#memory_$Pointer$.base_116| |v_ULTIMATE.start_main_~new_process~0#1.base_21| v_ArrVal_1240) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_21|)))) (store .cse9 v_ArrVal_1266 (store v_ArrVal_1254 .cse10 (select (select (store .cse9 v_ArrVal_1266 v_ArrVal_1254) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)))))) (store .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1266))) v_ArrVal_1266) .cse10)) |c_ULTIMATE.start_main_~#queue~0#1.base|)))) (not (< v_ArrVal_1266 |c_#StackHeapBarrier|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~new_process~0#1.base_21| 1) v_ArrVal_1266) 0)))) is different from false [2022-07-21 02:21:51,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,531 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 84 treesize of output 82 [2022-07-21 02:21:51,536 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 49 treesize of output 45 [2022-07-21 02:21:51,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-21 02:21:51,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,618 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 84 treesize of output 82 [2022-07-21 02:21:51,622 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 49 treesize of output 45 [2022-07-21 02:21:51,625 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 24 treesize of output 20 [2022-07-21 02:21:51,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,693 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 84 treesize of output 82 [2022-07-21 02:21:51,697 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 49 treesize of output 45 [2022-07-21 02:21:51,699 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 24 treesize of output 20 [2022-07-21 02:21:51,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,770 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 84 treesize of output 82 [2022-07-21 02:21:51,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-21 02:21:51,777 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 24 treesize of output 20 [2022-07-21 02:21:51,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,845 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 84 treesize of output 82 [2022-07-21 02:21:51,849 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 49 treesize of output 45 [2022-07-21 02:21:51,851 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 24 treesize of output 20 [2022-07-21 02:21:51,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,920 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 84 treesize of output 82 [2022-07-21 02:21:51,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-21 02:21:51,926 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 24 treesize of output 20 [2022-07-21 02:21:51,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:51,989 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 84 treesize of output 82 [2022-07-21 02:21:51,993 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 49 treesize of output 45 [2022-07-21 02:21:51,995 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 24 treesize of output 20 [2022-07-21 02:21:52,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,058 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 84 treesize of output 82 [2022-07-21 02:21:52,061 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 49 treesize of output 45 [2022-07-21 02:21:52,066 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 24 treesize of output 20 [2022-07-21 02:21:52,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,131 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 84 treesize of output 82 [2022-07-21 02:21:52,135 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 49 treesize of output 45 [2022-07-21 02:21:52,137 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 24 treesize of output 20 [2022-07-21 02:21:52,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,205 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 84 treesize of output 82 [2022-07-21 02:21:52,209 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 49 treesize of output 45 [2022-07-21 02:21:52,211 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 24 treesize of output 20 [2022-07-21 02:21:52,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,278 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 84 treesize of output 82 [2022-07-21 02:21:52,290 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 49 treesize of output 45 [2022-07-21 02:21:52,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-21 02:21:52,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-07-21 02:21:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873168404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:21:52,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:21:52,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2022-07-21 02:21:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373193120] [2022-07-21 02:21:52,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:21:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 02:21:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:21:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 02:21:52,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=439, Unknown=4, NotChecked=132, Total=650 [2022-07-21 02:21:52,360 INFO L87 Difference]: Start difference. First operand 927 states and 1175 transitions. Second operand has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:21:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:21:52,977 INFO L93 Difference]: Finished difference Result 947 states and 1198 transitions. [2022-07-21 02:21:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 02:21:52,978 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-21 02:21:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:21:52,980 INFO L225 Difference]: With dead ends: 947 [2022-07-21 02:21:52,980 INFO L226 Difference]: Without dead ends: 945 [2022-07-21 02:21:52,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=738, Unknown=4, NotChecked=174, Total=1056 [2022-07-21 02:21:52,983 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:21:52,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 281 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2022-07-21 02:21:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-21 02:21:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 934. [2022-07-21 02:21:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 1.2679528403001072) internal successors, (1183), 933 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states 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:21:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1183 transitions. [2022-07-21 02:21:53,032 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1183 transitions. Word has length 33 [2022-07-21 02:21:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:21:53,032 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1183 transitions. [2022-07-21 02:21:53,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:21:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1183 transitions. [2022-07-21 02:21:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:21:53,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:21:53,032 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-21 02:21:53,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 02:21:53,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-21 02:21:53,247 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:21:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:21:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1607684877, now seen corresponding path program 2 times [2022-07-21 02:21:53,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:21:53,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965158387] [2022-07-21 02:21:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:21:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:21:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:21:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 02:21:53,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:21:53,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965158387] [2022-07-21 02:21:53,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965158387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:21:53,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584244912] [2022-07-21 02:21:53,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:21:53,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:21:53,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:21:53,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:21:53,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 02:21:53,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:21:53,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:21:53,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-21 02:21:53,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:21:53,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:21:53,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 02:21:53,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-07-21 02:21:53,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,708 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 24 treesize of output 24 [2022-07-21 02:21:53,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 11 [2022-07-21 02:21:53,723 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-21 02:21:53,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-21 02:21:53,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:21:53,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,942 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 63 treesize of output 57 [2022-07-21 02:21:53,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,954 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-21 02:21:53,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 64 [2022-07-21 02:21:53,958 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 0 case distinctions, treesize of input 58 treesize of output 47 [2022-07-21 02:21:53,962 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 0 case distinctions, treesize of input 50 treesize of output 41 [2022-07-21 02:21:53,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 02:21:53,969 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 12 treesize of output 11 [2022-07-21 02:21:53,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:53,978 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-21 02:21:53,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-21 02:21:54,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:21:54,181 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-21 02:21:54,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 83 [2022-07-21 02:21:54,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:21:54,192 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-21 02:21:54,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-07-21 02:21:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 02:21:54,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:21:55,067 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-07-21 02:21:55,067 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 1532 treesize of output 1380 [2022-07-21 02:21:55,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:55,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1380 treesize of output 1356 [2022-07-21 02:21:55,218 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-07-21 02:21:55,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1386 treesize of output 640 [2022-07-21 02:21:55,369 INFO L356 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-07-21 02:21:55,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13926 treesize of output 13282 [2022-07-21 02:21:55,590 INFO L356 Elim1Store]: treesize reduction 82, result has 54.7 percent of original size [2022-07-21 02:21:55,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 42949 treesize of output 40000 [2022-07-21 02:21:56,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:21:56,027 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 40244 treesize of output 40148 [2022-07-21 02:21:56,522 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 1749 treesize of output 1699