./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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/forester-heap/sll-buckets-1.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 c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 10:29:21,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 10:29:21,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 10:29:21,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 10:29:21,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 10:29:21,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 10:29:21,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 10:29:21,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 10:29:21,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 10:29:21,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 10:29:21,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 10:29:21,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 10:29:21,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 10:29:21,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 10:29:21,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 10:29:21,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 10:29:21,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 10:29:21,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 10:29:21,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 10:29:21,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 10:29:21,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 10:29:21,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 10:29:21,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 10:29:21,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 10:29:21,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 10:29:21,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 10:29:21,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 10:29:21,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 10:29:21,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 10:29:21,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 10:29:21,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 10:29:21,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 10:29:21,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 10:29:21,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 10:29:21,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 10:29:21,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 10:29:21,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 10:29:21,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 10:29:21,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 10:29:21,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 10:29:21,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 10:29:21,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 10:29:21,123 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 10:29:21,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 10:29:21,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 10:29:21,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 10:29:21,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 10:29:21,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 10:29:21,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 10:29:21,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 10:29:21,126 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 10:29:21,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 10:29:21,126 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 10:29:21,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 10:29:21,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 10:29:21,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 10:29:21,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 10:29:21,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 10:29:21,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 10:29:21,127 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 10:29:21,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 10:29:21,128 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 10:29:21,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 10:29:21,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 10:29:21,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 10:29:21,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 10:29:21,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 10:29:21,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 10:29:21,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 10:29:21,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 10:29:21,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 10:29:21,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 10:29:21,130 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 10:29:21,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 10:29:21,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 10:29:21,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 10:29:21,131 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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2021-12-22 10:29:21,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 10:29:21,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 10:29:21,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 10:29:21,317 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 10:29:21,318 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 10:29:21,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-22 10:29:21,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe196112/0d21eaabf580465b956f5e4238a32fef/FLAG428c21109 [2021-12-22 10:29:21,750 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 10:29:21,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-22 10:29:21,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe196112/0d21eaabf580465b956f5e4238a32fef/FLAG428c21109 [2021-12-22 10:29:21,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe196112/0d21eaabf580465b956f5e4238a32fef [2021-12-22 10:29:21,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 10:29:21,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 10:29:21,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 10:29:21,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 10:29:21,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 10:29:21,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:29:21" (1/1) ... [2021-12-22 10:29:21,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea833ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:21, skipping insertion in model container [2021-12-22 10:29:21,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:29:21" (1/1) ... [2021-12-22 10:29:21,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 10:29:21,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 10:29:22,034 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/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-22 10:29:22,038 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/forester-heap/sll-buckets-1.i[22734,22747] [2021-12-22 10:29:22,039 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/forester-heap/sll-buckets-1.i[22862,22875] [2021-12-22 10:29:22,045 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/forester-heap/sll-buckets-1.i[23275,23288] [2021-12-22 10:29:22,045 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/forester-heap/sll-buckets-1.i[23364,23377] [2021-12-22 10:29:22,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 10:29:22,056 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 10:29:22,085 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/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-22 10:29:22,092 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/forester-heap/sll-buckets-1.i[22734,22747] [2021-12-22 10:29:22,095 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/forester-heap/sll-buckets-1.i[22862,22875] [2021-12-22 10:29:22,103 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/forester-heap/sll-buckets-1.i[23275,23288] [2021-12-22 10:29:22,105 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/forester-heap/sll-buckets-1.i[23364,23377] [2021-12-22 10:29:22,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 10:29:22,126 INFO L208 MainTranslator]: Completed translation [2021-12-22 10:29:22,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22 WrapperNode [2021-12-22 10:29:22,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 10:29:22,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 10:29:22,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 10:29:22,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 10:29:22,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,174 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2021-12-22 10:29:22,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 10:29:22,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 10:29:22,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 10:29:22,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 10:29:22,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 10:29:22,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 10:29:22,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 10:29:22,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 10:29:22,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (1/1) ... [2021-12-22 10:29:22,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 10:29:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:22,256 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) [2021-12-22 10:29:22,257 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 [2021-12-22 10:29:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 10:29:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 10:29:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 10:29:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 10:29:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 10:29:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 10:29:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 10:29:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 10:29:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 10:29:22,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 10:29:22,349 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 10:29:22,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 10:29:22,596 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 10:29:22,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 10:29:22,600 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-22 10:29:22,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:29:22 BoogieIcfgContainer [2021-12-22 10:29:22,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 10:29:22,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 10:29:22,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 10:29:22,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 10:29:22,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:29:21" (1/3) ... [2021-12-22 10:29:22,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a1cbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:29:22, skipping insertion in model container [2021-12-22 10:29:22,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:29:22" (2/3) ... [2021-12-22 10:29:22,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a1cbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:29:22, skipping insertion in model container [2021-12-22 10:29:22,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:29:22" (3/3) ... [2021-12-22 10:29:22,611 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2021-12-22 10:29:22,615 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 10:29:22,615 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-12-22 10:29:22,644 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 10:29:22,648 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 10:29:22,648 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-22 10:29:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 10:29:22,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:22,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:22,661 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2021-12-22 10:29:22,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:22,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302715215] [2021-12-22 10:29:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:22,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:22,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:22,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302715215] [2021-12-22 10:29:22,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302715215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:29:22,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:29:22,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:29:22,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294610501] [2021-12-22 10:29:22,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:29:22,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:29:22,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:22,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:29:22,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:29:22,939 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:23,007 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2021-12-22 10:29:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:29:23,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 10:29:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:23,016 INFO L225 Difference]: With dead ends: 112 [2021-12-22 10:29:23,016 INFO L226 Difference]: Without dead ends: 66 [2021-12-22 10:29:23,019 INFO L932 BasicCegarLoop]: 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 [2021-12-22 10:29:23,022 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:23,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 84 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:29:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-22 10:29:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2021-12-22 10:29:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2021-12-22 10:29:23,045 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2021-12-22 10:29:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:23,046 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-12-22 10:29:23,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-12-22 10:29:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 10:29:23,047 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:23,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:23,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 10:29:23,047 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:23,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2021-12-22 10:29:23,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:23,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418962376] [2021-12-22 10:29:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:23,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:23,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:23,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418962376] [2021-12-22 10:29:23,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418962376] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:29:23,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:29:23,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 10:29:23,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386658979] [2021-12-22 10:29:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:29:23,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 10:29:23,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 10:29:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 10:29:23,127 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:23,145 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-22 10:29:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 10:29:23,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-22 10:29:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:23,146 INFO L225 Difference]: With dead ends: 45 [2021-12-22 10:29:23,146 INFO L226 Difference]: Without dead ends: 43 [2021-12-22 10:29:23,146 INFO L932 BasicCegarLoop]: 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 [2021-12-22 10:29:23,147 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:23,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:29:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-22 10:29:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2021-12-22 10:29:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2021-12-22 10:29:23,151 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2021-12-22 10:29:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:23,152 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-12-22 10:29:23,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2021-12-22 10:29:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 10:29:23,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:23,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:23,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 10:29:23,153 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:23,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2021-12-22 10:29:23,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:23,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126291584] [2021-12-22 10:29:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:23,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:23,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:23,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126291584] [2021-12-22 10:29:23,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126291584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:29:23,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:29:23,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 10:29:23,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559866009] [2021-12-22 10:29:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:29:23,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 10:29:23,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 10:29:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:29:23,257 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:23,367 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2021-12-22 10:29:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 10:29:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 10:29:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:23,371 INFO L225 Difference]: With dead ends: 61 [2021-12-22 10:29:23,371 INFO L226 Difference]: Without dead ends: 50 [2021-12-22 10:29:23,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 10:29:23,372 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:23,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 10:29:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-22 10:29:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-22 10:29:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-12-22 10:29:23,380 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2021-12-22 10:29:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:23,381 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-12-22 10:29:23,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-12-22 10:29:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 10:29:23,381 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:23,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:23,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 10:29:23,382 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2021-12-22 10:29:23,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:23,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255112418] [2021-12-22 10:29:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:23,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:23,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:23,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255112418] [2021-12-22 10:29:23,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255112418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:29:23,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:29:23,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 10:29:23,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861141292] [2021-12-22 10:29:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:29:23,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 10:29:23,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:23,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 10:29:23,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 10:29:23,430 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:23,459 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-22 10:29:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 10:29:23,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 10:29:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:23,460 INFO L225 Difference]: With dead ends: 45 [2021-12-22 10:29:23,460 INFO L226 Difference]: Without dead ends: 43 [2021-12-22 10:29:23,460 INFO L932 BasicCegarLoop]: 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 [2021-12-22 10:29:23,461 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:23,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:29:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-22 10:29:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-12-22 10:29:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2021-12-22 10:29:23,465 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2021-12-22 10:29:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:23,465 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2021-12-22 10:29:23,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2021-12-22 10:29:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 10:29:23,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:23,466 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:23,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 10:29:23,467 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2021-12-22 10:29:23,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:23,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744845711] [2021-12-22 10:29:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:23,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:23,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:23,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744845711] [2021-12-22 10:29:23,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744845711] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:23,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347167517] [2021-12-22 10:29:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:23,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:23,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:23,685 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) [2021-12-22 10:29:23,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 10:29:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:23,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-22 10:29:23,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:23,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:23,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-22 10:29:23,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:23,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2021-12-22 10:29:23,983 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-22 10:29:23,983 INFO L387 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 2 case distinctions, treesize of input 75 treesize of output 74 [2021-12-22 10:29:23,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:23,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:23,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:23,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2021-12-22 10:29:24,000 INFO L387 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 15 treesize of output 23 [2021-12-22 10:29:24,007 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-22 10:29:24,008 INFO L387 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 35 treesize of output 27 [2021-12-22 10:29:24,026 INFO L387 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 15 treesize of output 23 [2021-12-22 10:29:24,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:24,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2021-12-22 10:29:24,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:24,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:29:24,178 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-22 10:29:24,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 51 [2021-12-22 10:29:24,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:24,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:29:24,299 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:29:24,299 INFO L387 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 76 treesize of output 44 [2021-12-22 10:29:24,311 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-22 10:29:24,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 21 [2021-12-22 10:29:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:24,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:29:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:24,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347167517] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:29:24,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:29:24,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-12-22 10:29:24,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231270025] [2021-12-22 10:29:24,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:29:24,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 10:29:24,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:24,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 10:29:24,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-12-22 10:29:24,535 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:24,844 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2021-12-22 10:29:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 10:29:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 10:29:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:24,845 INFO L225 Difference]: With dead ends: 64 [2021-12-22 10:29:24,845 INFO L226 Difference]: Without dead ends: 53 [2021-12-22 10:29:24,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-12-22 10:29:24,846 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:24,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 219 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 187 Invalid, 0 Unknown, 28 Unchecked, 0.2s Time] [2021-12-22 10:29:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-22 10:29:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2021-12-22 10:29:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2021-12-22 10:29:24,850 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2021-12-22 10:29:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:24,850 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2021-12-22 10:29:24,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2021-12-22 10:29:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 10:29:24,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:24,851 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:24,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 10:29:25,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:25,052 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2021-12-22 10:29:25,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:25,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005692817] [2021-12-22 10:29:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:25,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:25,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:25,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005692817] [2021-12-22 10:29:25,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005692817] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:25,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262293463] [2021-12-22 10:29:25,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:25,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:25,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:25,111 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) [2021-12-22 10:29:25,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 10:29:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:25,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-22 10:29:25,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:25,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:25,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-22 10:29:25,243 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-22 10:29:25,243 INFO L387 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 2 case distinctions, treesize of input 80 treesize of output 77 [2021-12-22 10:29:25,269 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-22 10:29:25,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 51 treesize of output 46 [2021-12-22 10:29:25,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2021-12-22 10:29:25,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:25,340 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-22 10:29:25,341 INFO L387 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 85 treesize of output 67 [2021-12-22 10:29:25,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:25,353 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-22 10:29:25,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2021-12-22 10:29:25,406 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-22 10:29:25,407 INFO L387 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 83 treesize of output 65 [2021-12-22 10:29:25,531 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-22 10:29:25,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 29 [2021-12-22 10:29:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:25,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:29:25,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2021-12-22 10:29:25,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_23| Int) (v_ArrVal_676 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_23| v_ArrVal_676) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_23|) 0)))) is different from false [2021-12-22 10:29:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:25,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262293463] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:29:25,602 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:29:25,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-22 10:29:25,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167686212] [2021-12-22 10:29:25,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:29:25,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 10:29:25,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 10:29:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2021-12-22 10:29:25,604 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:26,037 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2021-12-22 10:29:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 10:29:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-22 10:29:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:26,038 INFO L225 Difference]: With dead ends: 155 [2021-12-22 10:29:26,038 INFO L226 Difference]: Without dead ends: 153 [2021-12-22 10:29:26,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=262, Unknown=2, NotChecked=74, Total=462 [2021-12-22 10:29:26,039 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 283 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:26,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 326 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 264 Invalid, 0 Unknown, 167 Unchecked, 0.2s Time] [2021-12-22 10:29:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-22 10:29:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 71. [2021-12-22 10:29:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2021-12-22 10:29:26,045 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 16 [2021-12-22 10:29:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:26,045 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2021-12-22 10:29:26,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2021-12-22 10:29:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 10:29:26,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:26,046 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:26,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 10:29:26,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-22 10:29:26,260 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2021-12-22 10:29:26,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:26,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101758500] [2021-12-22 10:29:26,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:26,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:26,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:26,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101758500] [2021-12-22 10:29:26,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101758500] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:26,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683137222] [2021-12-22 10:29:26,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 10:29:26,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:26,369 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) [2021-12-22 10:29:26,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 10:29:26,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 10:29:26,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:29:26,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-22 10:29:26,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:26,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:26,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:26,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:26,666 INFO L387 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 27 treesize of output 35 [2021-12-22 10:29:26,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:26,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:26,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:26,671 INFO L387 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 19 treesize of output 23 [2021-12-22 10:29:26,686 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-22 10:29:26,687 INFO L387 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 4 case distinctions, treesize of input 35 treesize of output 34 [2021-12-22 10:29:26,764 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 10:29:26,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-22 10:29:26,769 INFO L387 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 7 treesize of output 3 [2021-12-22 10:29:26,787 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-22 10:29:26,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-12-22 10:29:26,810 INFO L387 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 23 treesize of output 22 [2021-12-22 10:29:26,905 INFO L387 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 33 treesize of output 13 [2021-12-22 10:29:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 10:29:26,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:29:26,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683137222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:29:26,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 10:29:26,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-12-22 10:29:26,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136971316] [2021-12-22 10:29:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:29:26,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 10:29:26,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 10:29:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-22 10:29:26,933 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:27,121 INFO L93 Difference]: Finished difference Result 138 states and 171 transitions. [2021-12-22 10:29:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 10:29:27,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-22 10:29:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:27,122 INFO L225 Difference]: With dead ends: 138 [2021-12-22 10:29:27,122 INFO L226 Difference]: Without dead ends: 103 [2021-12-22 10:29:27,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-12-22 10:29:27,123 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:27,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 142 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2021-12-22 10:29:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-22 10:29:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2021-12-22 10:29:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2021-12-22 10:29:27,129 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 18 [2021-12-22 10:29:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:27,130 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2021-12-22 10:29:27,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-12-22 10:29:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 10:29:27,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:27,131 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:27,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 10:29:27,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:27,340 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2021-12-22 10:29:27,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:27,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165974455] [2021-12-22 10:29:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:27,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:27,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:27,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165974455] [2021-12-22 10:29:27,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165974455] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:27,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702182956] [2021-12-22 10:29:27,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:27,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:27,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:27,468 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) [2021-12-22 10:29:27,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 10:29:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:27,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-22 10:29:27,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:27,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,618 INFO L387 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 27 treesize of output 35 [2021-12-22 10:29:27,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-22 10:29:27,645 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-22 10:29:27,645 INFO L387 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 112 [2021-12-22 10:29:27,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2021-12-22 10:29:27,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 [2021-12-22 10:29:27,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-12-22 10:29:27,690 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-22 10:29:27,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 51 treesize of output 46 [2021-12-22 10:29:27,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2021-12-22 10:29:27,708 INFO L387 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 15 treesize of output 23 [2021-12-22 10:29:27,807 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 10:29:27,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-22 10:29:27,814 INFO L387 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 7 treesize of output 3 [2021-12-22 10:29:27,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,831 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-22 10:29:27,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 73 [2021-12-22 10:29:27,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,849 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-22 10:29:27,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-22 10:29:27,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,855 INFO L387 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 45 treesize of output 42 [2021-12-22 10:29:27,964 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-22 10:29:27,965 INFO L387 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 86 treesize of output 72 [2021-12-22 10:29:27,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:27,969 INFO L387 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 45 treesize of output 42 [2021-12-22 10:29:27,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-22 10:29:28,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2021-12-22 10:29:28,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:28,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2021-12-22 10:29:28,319 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:29:28,319 INFO L387 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 59 treesize of output 26 [2021-12-22 10:29:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:28,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:29:28,430 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 1)) (forall ((v_ArrVal_1063 (Array Int Int)) (v_ArrVal_1062 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1063))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1062) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0)))) is different from false [2021-12-22 10:29:28,446 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:29:28,446 INFO L387 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 17 treesize of output 21 [2021-12-22 10:29:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:28,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702182956] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:29:28,561 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:29:28,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2021-12-22 10:29:28,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867584400] [2021-12-22 10:29:28,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:29:28,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 10:29:28,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 10:29:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=280, Unknown=3, NotChecked=34, Total=380 [2021-12-22 10:29:28,563 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:29,221 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2021-12-22 10:29:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 10:29:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 10:29:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:29,222 INFO L225 Difference]: With dead ends: 159 [2021-12-22 10:29:29,222 INFO L226 Difference]: Without dead ends: 109 [2021-12-22 10:29:29,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=526, Unknown=3, NotChecked=50, Total=756 [2021-12-22 10:29:29,223 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 138 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:29,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 251 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 282 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2021-12-22 10:29:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-22 10:29:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2021-12-22 10:29:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 84 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2021-12-22 10:29:29,230 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 19 [2021-12-22 10:29:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:29,230 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2021-12-22 10:29:29,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2021-12-22 10:29:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 10:29:29,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:29,231 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:29,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-22 10:29:29,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:29,443 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2021-12-22 10:29:29,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:29,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939014383] [2021-12-22 10:29:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:29,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:29,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:29,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939014383] [2021-12-22 10:29:29,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939014383] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:29,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295302589] [2021-12-22 10:29:29,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 10:29:29,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:29,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:29,635 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) [2021-12-22 10:29:29,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 10:29:29,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 10:29:29,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:29:29,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-22 10:29:29,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:29,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:29,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2021-12-22 10:29:29,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:29,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2021-12-22 10:29:29,911 INFO L353 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2021-12-22 10:29:29,912 INFO L387 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 2 case distinctions, treesize of input 63 treesize of output 74 [2021-12-22 10:29:29,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:29,932 INFO L353 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2021-12-22 10:29:29,932 INFO L387 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 2 case distinctions, treesize of input 31 treesize of output 45 [2021-12-22 10:29:29,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2021-12-22 10:29:29,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-22 10:29:29,963 INFO L387 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 13 treesize of output 19 [2021-12-22 10:29:29,968 INFO L387 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 13 treesize of output 19 [2021-12-22 10:29:29,972 INFO L387 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 14 treesize of output 10 [2021-12-22 10:29:29,988 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-22 10:29:29,999 INFO L387 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 31 treesize of output 23 [2021-12-22 10:29:30,039 INFO L387 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 46 treesize of output 36 [2021-12-22 10:29:30,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:30,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:29:30,405 INFO L353 Elim1Store]: treesize reduction 168, result has 38.7 percent of original size [2021-12-22 10:29:30,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 190 treesize of output 275 [2021-12-22 10:29:30,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:30,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:29:30,455 INFO L353 Elim1Store]: treesize reduction 124, result has 28.7 percent of original size [2021-12-22 10:29:30,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 31 case distinctions, treesize of input 288 treesize of output 245 [2021-12-22 10:29:32,749 INFO L353 Elim1Store]: treesize reduction 323, result has 14.8 percent of original size [2021-12-22 10:29:32,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 175 treesize of output 174 [2021-12-22 10:29:32,805 INFO L353 Elim1Store]: treesize reduction 291, result has 12.9 percent of original size [2021-12-22 10:29:32,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 194 treesize of output 161 [2021-12-22 10:29:33,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:33,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:29:33,083 INFO L353 Elim1Store]: treesize reduction 115, result has 14.2 percent of original size [2021-12-22 10:29:33,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 209 treesize of output 117 [2021-12-22 10:29:33,100 INFO L353 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-22 10:29:33,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 50 [2021-12-22 10:29:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:33,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:29:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:37,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295302589] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:29:37,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:29:37,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2021-12-22 10:29:37,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653368844] [2021-12-22 10:29:37,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:29:37,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 10:29:37,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 10:29:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=355, Unknown=1, NotChecked=0, Total=420 [2021-12-22 10:29:37,063 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:37,547 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2021-12-22 10:29:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 10:29:37,547 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 10:29:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:37,548 INFO L225 Difference]: With dead ends: 106 [2021-12-22 10:29:37,548 INFO L226 Difference]: Without dead ends: 78 [2021-12-22 10:29:37,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=120, Invalid=635, Unknown=1, NotChecked=0, Total=756 [2021-12-22 10:29:37,548 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:37,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 324 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 64 Unchecked, 0.0s Time] [2021-12-22 10:29:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-22 10:29:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2021-12-22 10:29:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.24) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2021-12-22 10:29:37,553 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 20 [2021-12-22 10:29:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:37,553 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2021-12-22 10:29:37,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2021-12-22 10:29:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 10:29:37,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:37,553 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:37,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 10:29:37,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:37,754 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2021-12-22 10:29:37,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:37,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890326980] [2021-12-22 10:29:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:37,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 10:29:37,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:37,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890326980] [2021-12-22 10:29:37,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890326980] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:37,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526233831] [2021-12-22 10:29:37,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 10:29:37,893 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:37,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:37,904 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) [2021-12-22 10:29:37,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 10:29:38,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 10:29:38,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:29:38,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-22 10:29:38,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:38,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:38,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2021-12-22 10:29:38,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:38,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2021-12-22 10:29:38,384 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-22 10:29:38,384 INFO L387 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 2 case distinctions, treesize of input 98 treesize of output 93 [2021-12-22 10:29:38,389 INFO L387 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 28 treesize of output 40 [2021-12-22 10:29:38,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:38,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:38,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:38,394 INFO L387 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 21 treesize of output 25 [2021-12-22 10:29:38,417 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-22 10:29:38,417 INFO L387 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 4 case distinctions, treesize of input 51 treesize of output 46 [2021-12-22 10:29:38,421 INFO L387 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 18 treesize of output 20 [2021-12-22 10:29:38,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:38,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2021-12-22 10:29:38,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:38,497 INFO L387 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 18 treesize of output 20 [2021-12-22 10:29:38,512 INFO L353 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-22 10:29:38,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2021-12-22 10:29:38,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-22 10:29:38,570 INFO L387 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 34 treesize of output 32 [2021-12-22 10:29:38,573 INFO L387 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 25 treesize of output 24 [2021-12-22 10:29:38,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-22 10:29:38,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 10:29:38,727 INFO L387 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 35 treesize of output 19 [2021-12-22 10:29:38,750 INFO L387 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 33 treesize of output 13 [2021-12-22 10:29:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 10:29:38,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:29:38,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1460 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1)) is different from false [2021-12-22 10:29:38,848 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:29:38,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2021-12-22 10:29:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 10:29:38,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526233831] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:29:38,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:29:38,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-12-22 10:29:38,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591860899] [2021-12-22 10:29:38,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:29:38,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 10:29:38,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 10:29:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=291, Unknown=1, NotChecked=34, Total=380 [2021-12-22 10:29:38,933 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 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) [2021-12-22 10:29:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:39,471 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2021-12-22 10:29:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 10:29:39,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 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 21 [2021-12-22 10:29:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:39,472 INFO L225 Difference]: With dead ends: 141 [2021-12-22 10:29:39,472 INFO L226 Difference]: Without dead ends: 106 [2021-12-22 10:29:39,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=414, Unknown=1, NotChecked=42, Total=552 [2021-12-22 10:29:39,473 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:39,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 312 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 370 Invalid, 0 Unknown, 66 Unchecked, 0.4s Time] [2021-12-22 10:29:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-22 10:29:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2021-12-22 10:29:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 78 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2021-12-22 10:29:39,477 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 21 [2021-12-22 10:29:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:39,477 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2021-12-22 10:29:39,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 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) [2021-12-22 10:29:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2021-12-22 10:29:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 10:29:39,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:39,477 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:39,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 10:29:39,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:39,678 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:39,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2021-12-22 10:29:39,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:39,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042423853] [2021-12-22 10:29:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:39,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:39,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042423853] [2021-12-22 10:29:39,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042423853] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401617061] [2021-12-22 10:29:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:39,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:39,816 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) [2021-12-22 10:29:39,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 10:29:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:39,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-22 10:29:39,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:39,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:39,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-22 10:29:39,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:39,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2021-12-22 10:29:40,000 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-22 10:29:40,000 INFO L387 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 2 case distinctions, treesize of input 82 treesize of output 81 [2021-12-22 10:29:40,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,006 INFO L387 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 36 treesize of output 38 [2021-12-22 10:29:40,026 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-22 10:29:40,027 INFO L387 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 4 case distinctions, treesize of input 51 treesize of output 46 [2021-12-22 10:29:40,032 INFO L387 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 15 treesize of output 23 [2021-12-22 10:29:40,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2021-12-22 10:29:40,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2021-12-22 10:29:40,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,132 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-22 10:29:40,132 INFO L387 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 105 treesize of output 81 [2021-12-22 10:29:40,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,140 INFO L387 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 45 treesize of output 42 [2021-12-22 10:29:40,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,144 INFO L387 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 22 treesize of output 24 [2021-12-22 10:29:40,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,157 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-22 10:29:40,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2021-12-22 10:29:40,258 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-22 10:29:40,258 INFO L387 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 103 treesize of output 79 [2021-12-22 10:29:40,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:40,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2021-12-22 10:29:40,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2021-12-22 10:29:40,618 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-22 10:29:40,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 65 [2021-12-22 10:29:40,626 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-22 10:29:40,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2021-12-22 10:29:40,651 INFO L387 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 33 treesize of output 13 [2021-12-22 10:29:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:40,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:29:40,747 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= 2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1666)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1665))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))))) is different from false [2021-12-22 10:29:40,758 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:29:40,758 INFO L387 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 59 treesize of output 63 [2021-12-22 10:29:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:40,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401617061] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:29:40,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:29:40,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2021-12-22 10:29:40,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449810490] [2021-12-22 10:29:40,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:29:40,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 10:29:40,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 10:29:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2021-12-22 10:29:40,858 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:41,846 INFO L93 Difference]: Finished difference Result 229 states and 285 transitions. [2021-12-22 10:29:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 10:29:41,847 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 10:29:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:41,848 INFO L225 Difference]: With dead ends: 229 [2021-12-22 10:29:41,848 INFO L226 Difference]: Without dead ends: 194 [2021-12-22 10:29:41,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=890, Unknown=1, NotChecked=64, Total=1190 [2021-12-22 10:29:41,849 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 273 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:41,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 390 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 554 Invalid, 0 Unknown, 197 Unchecked, 0.5s Time] [2021-12-22 10:29:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-22 10:29:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 119. [2021-12-22 10:29:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.264957264957265) internal successors, (148), 118 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2021-12-22 10:29:41,854 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 21 [2021-12-22 10:29:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:41,854 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2021-12-22 10:29:41,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2021-12-22 10:29:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-22 10:29:41,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:41,858 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:41,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 10:29:42,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:42,072 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2021-12-22 10:29:42,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:42,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141776417] [2021-12-22 10:29:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:42,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:42,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141776417] [2021-12-22 10:29:42,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141776417] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606919841] [2021-12-22 10:29:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:42,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:42,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:42,317 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) [2021-12-22 10:29:42,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-22 10:29:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:42,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-22 10:29:42,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:42,481 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-22 10:29:42,481 INFO L387 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 4 case distinctions, treesize of input 35 treesize of output 34 [2021-12-22 10:29:42,529 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-22 10:29:42,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 10:29:42,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 10:29:42,666 INFO L387 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 [2021-12-22 10:29:42,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2021-12-22 10:29:42,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:29:42,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:42,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2021-12-22 10:29:42,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-12-22 10:29:42,741 INFO L387 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 19 treesize of output 7 [2021-12-22 10:29:42,792 INFO L387 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 [2021-12-22 10:29:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:42,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:29:42,864 INFO L387 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 184 treesize of output 178 [2021-12-22 10:29:42,867 INFO L387 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 330 treesize of output 318 [2021-12-22 10:29:56,086 INFO L353 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2021-12-22 10:29:56,087 INFO L387 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 2 case distinctions, treesize of input 110 treesize of output 104 [2021-12-22 10:29:56,093 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:29:56,093 INFO L387 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 102 treesize of output 96 [2021-12-22 10:29:56,099 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-22 10:29:56,100 INFO L387 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 124 treesize of output 104 [2021-12-22 10:29:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:56,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606919841] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:29:56,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:29:56,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2021-12-22 10:29:56,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925598814] [2021-12-22 10:29:56,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:29:56,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-22 10:29:56,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:29:56,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-22 10:29:56,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=466, Unknown=6, NotChecked=0, Total=552 [2021-12-22 10:29:56,157 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:29:58,317 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2021-12-22 10:29:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 10:29:58,317 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-22 10:29:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:29:58,318 INFO L225 Difference]: With dead ends: 159 [2021-12-22 10:29:58,318 INFO L226 Difference]: Without dead ends: 157 [2021-12-22 10:29:58,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=146, Invalid=839, Unknown=7, NotChecked=0, Total=992 [2021-12-22 10:29:58,319 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 131 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:29:58,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 277 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 206 Invalid, 0 Unknown, 295 Unchecked, 0.2s Time] [2021-12-22 10:29:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-22 10:29:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2021-12-22 10:29:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 123 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 154 transitions. [2021-12-22 10:29:58,326 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 154 transitions. Word has length 24 [2021-12-22 10:29:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:29:58,326 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 154 transitions. [2021-12-22 10:29:58,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:29:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2021-12-22 10:29:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 10:29:58,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:29:58,327 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:29:58,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-22 10:29:58,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-22 10:29:58,546 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:29:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:29:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2021-12-22 10:29:58,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:29:58,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289163691] [2021-12-22 10:29:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:58,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:29:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:29:58,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:29:58,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289163691] [2021-12-22 10:29:58,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289163691] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:29:58,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517819306] [2021-12-22 10:29:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:29:58,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:29:58,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:29:58,706 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) [2021-12-22 10:29:58,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-22 10:29:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:29:58,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-22 10:29:58,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:29:58,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:58,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2021-12-22 10:29:58,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:58,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2021-12-22 10:29:58,917 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-22 10:29:58,917 INFO L387 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 2 case distinctions, treesize of input 69 treesize of output 68 [2021-12-22 10:29:58,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:58,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:58,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:58,922 INFO L387 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 36 treesize of output 38 [2021-12-22 10:29:58,926 INFO L387 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 15 treesize of output 23 [2021-12-22 10:29:58,931 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-22 10:29:58,931 INFO L387 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 35 treesize of output 27 [2021-12-22 10:29:58,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:58,986 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-22 10:29:58,986 INFO L387 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 1 case distinctions, treesize of input 51 treesize of output 49 [2021-12-22 10:29:58,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:59,004 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-22 10:29:59,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 50 [2021-12-22 10:29:59,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:59,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:29:59,115 INFO L353 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-22 10:29:59,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2021-12-22 10:29:59,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:29:59,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:29:59,137 INFO L353 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2021-12-22 10:29:59,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 68 [2021-12-22 10:30:02,983 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-22 10:30:02,983 INFO L387 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 3 case distinctions, treesize of input 83 treesize of output 81 [2021-12-22 10:30:02,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:03,001 INFO L353 Elim1Store]: treesize reduction 14, result has 65.0 percent of original size [2021-12-22 10:30:03,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 75 [2021-12-22 10:30:03,131 INFO L387 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 31 treesize of output 15 [2021-12-22 10:30:03,134 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:30:03,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-22 10:30:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:30:03,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:30:03,185 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2088 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2087 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2087) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2021-12-22 10:30:03,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_ArrVal_2083 Int)) (or (and (forall ((v_ArrVal_2088 (Array Int Int))) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2084)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2083)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2088)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2087 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_2083)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2087)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2 v_ArrVal_2084)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2 v_ArrVal_2083)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))))) is different from false [2021-12-22 10:30:05,504 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (|v_ULTIMATE.start_main_~item~0#1.base_45| Int) (v_ArrVal_2083 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2084)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2088 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2084)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2088) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2087 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2087)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2021-12-22 10:30:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 10:30:05,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517819306] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:30:05,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:30:05,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2021-12-22 10:30:05,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393749254] [2021-12-22 10:30:05,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:30:05,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-22 10:30:05,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:30:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-22 10:30:05,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=314, Unknown=4, NotChecked=114, Total=506 [2021-12-22 10:30:05,589 INFO L87 Difference]: Start difference. First operand 124 states and 154 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:30:07,648 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse5 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (= (select .cse1 .cse2) 0) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse4 .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse5) 0) (= (select .cse3 4) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (forall ((v_ArrVal_2084 Int) (|v_ULTIMATE.start_main_~item~0#1.base_45| Int) (v_ArrVal_2083 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2084)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2088 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2084)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2088) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2087 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2087)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse5) 0))))) is different from false [2021-12-22 10:30:09,653 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse0))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (= (select .cse1 .cse2) 0) (= (select .cse3 0) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select .cse4 .cse2) 0) (= (select .cse3 4) 0) (forall ((v_ArrVal_2084 Int) (|v_ULTIMATE.start_main_~item~0#1.base_45| Int) (v_ArrVal_2083 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2084)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2088 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2084)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2088) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2087 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0 0) 4 v_ArrVal_2083)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2087)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))))))) is different from false [2021-12-22 10:30:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:30:10,412 INFO L93 Difference]: Finished difference Result 151 states and 186 transitions. [2021-12-22 10:30:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 10:30:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 10:30:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:30:10,413 INFO L225 Difference]: With dead ends: 151 [2021-12-22 10:30:10,413 INFO L226 Difference]: Without dead ends: 140 [2021-12-22 10:30:10,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=149, Invalid=621, Unknown=6, NotChecked=280, Total=1056 [2021-12-22 10:30:10,414 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 66 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:30:10,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 278 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 261 Unchecked, 0.1s Time] [2021-12-22 10:30:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-22 10:30:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2021-12-22 10:30:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 132 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:30:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2021-12-22 10:30:10,421 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 27 [2021-12-22 10:30:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:30:10,421 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2021-12-22 10:30:10,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:30:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2021-12-22 10:30:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 10:30:10,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:30:10,422 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:30:10,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-22 10:30:10,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-22 10:30:10,632 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:30:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:30:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1921519731, now seen corresponding path program 1 times [2021-12-22 10:30:10,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:30:10,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730312505] [2021-12-22 10:30:10,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:30:10,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:30:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:30:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:30:10,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:30:10,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730312505] [2021-12-22 10:30:10,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730312505] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:30:10,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654154636] [2021-12-22 10:30:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:30:10,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:30:10,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:30:10,792 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) [2021-12-22 10:30:10,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-22 10:30:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:30:10,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-22 10:30:10,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:30:10,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:10,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-22 10:30:10,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:10,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2021-12-22 10:30:11,003 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-22 10:30:11,003 INFO L387 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 2 case distinctions, treesize of input 69 treesize of output 68 [2021-12-22 10:30:11,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:11,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:11,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:11,012 INFO L387 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 30 treesize of output 32 [2021-12-22 10:30:11,018 INFO L387 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 15 treesize of output 23 [2021-12-22 10:30:11,026 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-22 10:30:11,026 INFO L387 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 59 treesize of output 43 [2021-12-22 10:30:11,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:11,083 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-22 10:30:11,084 INFO L387 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 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-22 10:30:11,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:11,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:30:11,116 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-12-22 10:30:11,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 67 [2021-12-22 10:30:11,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:11,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:30:11,316 INFO L353 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2021-12-22 10:30:11,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 82 [2021-12-22 10:30:11,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:11,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 10:30:11,331 INFO L353 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-22 10:30:11,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 44 [2021-12-22 10:30:16,994 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-12-22 10:30:16,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 95 [2021-12-22 10:30:16,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:17,005 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-22 10:30:17,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 45 [2021-12-22 10:30:17,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-22 10:30:17,121 INFO L387 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 31 treesize of output 15 [2021-12-22 10:30:17,124 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:30:17,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-22 10:30:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:30:17,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:30:17,154 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2308 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2308) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2309 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2309) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2021-12-22 10:30:21,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2305 Int) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int) (v_ArrVal_2307 Int)) (or (and (= 0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2305)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2308 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2308)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2309 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2305)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2309) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2021-12-22 10:30:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 10:30:21,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654154636] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:30:21,594 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:30:21,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2021-12-22 10:30:21,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269287194] [2021-12-22 10:30:21,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:30:21,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-22 10:30:21,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:30:21,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-22 10:30:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=346, Unknown=5, NotChecked=78, Total=506 [2021-12-22 10:30:21,596 INFO L87 Difference]: Start difference. First operand 133 states and 165 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:30:23,636 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse6 (select .cse3 0))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (= (select .cse1 .cse2) 0) (= (select .cse3 4) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select .cse4 .cse2) 0) (forall ((v_ArrVal_2305 Int) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int) (v_ArrVal_2307 Int)) (or (and (= 0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2305)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2308 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2308)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2309 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2305)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2309) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (not (= .cse6 .cse0)) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= .cse0 0)) (not (= .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|))))))) is different from false [2021-12-22 10:30:25,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse6 (select .cse3 0))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (= (select .cse1 .cse2) 0) (= (select .cse3 4) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select .cse4 .cse2) 0) (forall ((v_ArrVal_2305 Int) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int) (v_ArrVal_2307 Int)) (or (and (= 0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2305)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2308 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2308)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2309 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2305)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0 0) 4 v_ArrVal_2307)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2309) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (not (= .cse6 .cse0)) (not (= .cse0 0)) (not (= .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|))))))) is different from false [2021-12-22 10:30:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:30:26,064 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2021-12-22 10:30:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 10:30:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 10:30:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:30:26,066 INFO L225 Difference]: With dead ends: 160 [2021-12-22 10:30:26,066 INFO L226 Difference]: Without dead ends: 149 [2021-12-22 10:30:26,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=173, Invalid=706, Unknown=7, NotChecked=236, Total=1122 [2021-12-22 10:30:26,066 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:30:26,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 435 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 298 Unchecked, 0.1s Time] [2021-12-22 10:30:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-22 10:30:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2021-12-22 10:30:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 132 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:30:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2021-12-22 10:30:26,073 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 27 [2021-12-22 10:30:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:30:26,073 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2021-12-22 10:30:26,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:30:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2021-12-22 10:30:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 10:30:26,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:30:26,074 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:30:26,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-22 10:30:26,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-22 10:30:26,288 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:30:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:30:26,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1308386699, now seen corresponding path program 1 times [2021-12-22 10:30:26,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:30:26,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423744270] [2021-12-22 10:30:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:30:26,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:30:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:30:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:30:26,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:30:26,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423744270] [2021-12-22 10:30:26,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423744270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:30:26,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:30:26,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 10:30:26,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538207392] [2021-12-22 10:30:26,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:30:26,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 10:30:26,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:30:26,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 10:30:26,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 10:30:26,424 INFO L87 Difference]: Start difference. First operand 133 states and 165 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) [2021-12-22 10:30:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:30:26,558 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2021-12-22 10:30:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 10:30:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 27 [2021-12-22 10:30:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:30:26,559 INFO L225 Difference]: With dead ends: 171 [2021-12-22 10:30:26,559 INFO L226 Difference]: Without dead ends: 136 [2021-12-22 10:30:26,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 10:30:26,560 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:30:26,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 105 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 10:30:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-22 10:30:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2021-12-22 10:30:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 1.2442748091603053) internal successors, (163), 132 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:30:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2021-12-22 10:30:26,567 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 27 [2021-12-22 10:30:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:30:26,567 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2021-12-22 10:30:26,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) [2021-12-22 10:30:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2021-12-22 10:30:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 10:30:26,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:30:26,570 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:30:26,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 10:30:26,570 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-22 10:30:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:30:26,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1764820376, now seen corresponding path program 2 times [2021-12-22 10:30:26,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:30:26,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807927955] [2021-12-22 10:30:26,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:30:26,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:30:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:30:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:30:26,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:30:26,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807927955] [2021-12-22 10:30:26,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807927955] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:30:26,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751841434] [2021-12-22 10:30:26,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 10:30:26,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:30:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:30:26,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 10:30:26,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-22 10:30:27,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 10:30:27,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:30:27,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-22 10:30:27,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:30:27,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,168 INFO L387 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 27 treesize of output 35 [2021-12-22 10:30:27,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2021-12-22 10:30:27,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2021-12-22 10:30:27,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,197 INFO L387 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 19 treesize of output 23 [2021-12-22 10:30:27,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,203 INFO L387 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 19 treesize of output 23 [2021-12-22 10:30:27,223 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-22 10:30:27,224 INFO L387 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 4 case distinctions, treesize of input 35 treesize of output 34 [2021-12-22 10:30:27,228 INFO L387 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 25 treesize of output 29 [2021-12-22 10:30:27,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2021-12-22 10:30:27,342 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 10:30:27,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-22 10:30:27,346 INFO L387 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 7 treesize of output 3 [2021-12-22 10:30:27,361 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 10:30:27,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-22 10:30:27,367 INFO L387 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 7 treesize of output 3 [2021-12-22 10:30:27,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:30:27,384 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 10:30:27,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2021-12-22 10:30:27,397 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-22 10:30:27,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 10:30:27,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 10:30:27,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-22 10:30:27,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 10:30:27,649 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:30:27,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2021-12-22 10:30:27,777 INFO L353 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-12-22 10:30:27,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-22 10:30:27,787 INFO L353 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-12-22 10:30:27,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-22 10:30:27,942 INFO L353 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2021-12-22 10:30:27,942 INFO L387 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 35 treesize of output 24 [2021-12-22 10:30:27,947 INFO L387 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 [2021-12-22 10:30:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 10:30:27,966 INFO L328 TraceCheckSpWp]: Computing backward predicates...