./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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-2.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 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:49:49,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:49:49,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:49:49,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:49:49,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:49:49,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:49:49,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:49:49,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:49:49,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:49:49,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:49:49,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:49:49,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:49:49,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:49:49,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:49:49,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:49:49,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:49:49,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:49:49,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:49:49,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:49:49,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:49:49,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:49:49,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:49:49,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:49:49,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:49:49,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:49:49,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:49:49,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:49:49,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:49:49,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:49:49,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:49:49,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:49:49,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:49:49,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:49:49,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:49:49,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:49:49,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:49:49,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:49:49,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:49:49,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:49:49,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:49:49,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:49:49,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 23:49:49,756 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:49:49,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:49:49,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:49:49,758 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:49:49,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:49:49,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:49:49,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:49:49,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:49:49,760 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:49:49,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:49:49,761 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:49:49,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 23:49:49,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:49:49,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:49:49,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:49:49,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:49:49,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:49:49,762 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:49:49,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:49:49,762 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:49:49,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:49:49,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:49:49,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:49:49,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:49:49,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:49:49,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:49:49,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:49:49,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:49:49,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 23:49:49,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 23:49:49,764 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:49:49,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:49:49,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:49:49,764 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 -> 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb [2021-12-27 23:49:50,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:49:50,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:49:50,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:49:50,038 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:49:50,040 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:49:50,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2021-12-27 23:49:50,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e45d07a/fdcecd13c3194339b39cde2ac49cf815/FLAGa3f1ee07d [2021-12-27 23:49:50,544 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:49:50,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2021-12-27 23:49:50,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e45d07a/fdcecd13c3194339b39cde2ac49cf815/FLAGa3f1ee07d [2021-12-27 23:49:50,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e45d07a/fdcecd13c3194339b39cde2ac49cf815 [2021-12-27 23:49:50,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:49:50,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:49:50,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:49:50,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:49:50,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:49:50,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:49:50" (1/1) ... [2021-12-27 23:49:50,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757bc2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:50, skipping insertion in model container [2021-12-27 23:49:50,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:49:50" (1/1) ... [2021-12-27 23:49:50,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:49:50,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:49:51,158 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-2.i[22663,22676] [2021-12-27 23:49:51,162 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-2.i[22734,22747] [2021-12-27 23:49:51,164 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-2.i[22862,22875] [2021-12-27 23:49:51,167 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-2.i[23275,23288] [2021-12-27 23:49:51,168 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-2.i[23364,23377] [2021-12-27 23:49:51,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:49:51,184 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:49:51,219 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-2.i[22663,22676] [2021-12-27 23:49:51,220 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-2.i[22734,22747] [2021-12-27 23:49:51,220 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-2.i[22862,22875] [2021-12-27 23:49:51,222 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-2.i[23275,23288] [2021-12-27 23:49:51,223 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-2.i[23364,23377] [2021-12-27 23:49:51,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:49:51,242 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:49:51,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51 WrapperNode [2021-12-27 23:49:51,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:49:51,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:49:51,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:49:51,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:49:51,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,288 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2021-12-27 23:49:51,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:49:51,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:49:51,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:49:51,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:49:51,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:49:51,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:49:51,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:49:51,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:49:51,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (1/1) ... [2021-12-27 23:49:51,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:49:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:51,364 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-27 23:49:51,369 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-27 23:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 23:49:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-27 23:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 23:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-27 23:49:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-27 23:49:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:49:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 23:49:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:49:51,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:49:51,480 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:49:51,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:49:51,773 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:49:51,777 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:49:51,778 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-27 23:49:51,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:49:51 BoogieIcfgContainer [2021-12-27 23:49:51,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:49:51,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:49:51,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:49:51,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:49:51,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:49:50" (1/3) ... [2021-12-27 23:49:51,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c470846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:49:51, skipping insertion in model container [2021-12-27 23:49:51,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:51" (2/3) ... [2021-12-27 23:49:51,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c470846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:49:51, skipping insertion in model container [2021-12-27 23:49:51,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:49:51" (3/3) ... [2021-12-27 23:49:51,786 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2021-12-27 23:49:51,789 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:49:51,790 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-12-27 23:49:51,822 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:49:51,829 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-27 23:49:51,829 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-27 23:49:51,843 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-27 23:49:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-27 23:49:51,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:51,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:51,861 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-27 23:49:51,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:51,867 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2021-12-27 23:49:51,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:51,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275730333] [2021-12-27 23:49:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:51,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:52,091 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-27 23:49:52,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:52,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275730333] [2021-12-27 23:49:52,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275730333] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:52,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:52,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:49:52,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688988679] [2021-12-27 23:49:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:52,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:49:52,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:52,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:49:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:49:52,125 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-27 23:49:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:52,203 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2021-12-27 23:49:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:49:52,207 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-27 23:49:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:52,213 INFO L225 Difference]: With dead ends: 112 [2021-12-27 23:49:52,213 INFO L226 Difference]: Without dead ends: 66 [2021-12-27 23:49:52,218 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-27 23:49:52,221 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-27 23:49:52,222 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-27 23:49:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-27 23:49:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2021-12-27 23:49:52,245 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-27 23:49:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2021-12-27 23:49:52,247 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2021-12-27 23:49:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:52,248 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-12-27 23:49:52,248 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-27 23:49:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-12-27 23:49:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-27 23:49:52,249 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:52,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:52,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 23:49:52,250 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-27 23:49:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:52,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2021-12-27 23:49:52,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:52,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074441358] [2021-12-27 23:49:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:52,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:52,351 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-27 23:49:52,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:52,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074441358] [2021-12-27 23:49:52,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074441358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:52,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:52,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 23:49:52,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117657778] [2021-12-27 23:49:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:52,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 23:49:52,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 23:49:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 23:49:52,358 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-27 23:49:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:52,385 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-27 23:49:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 23:49:52,387 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-27 23:49:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:52,389 INFO L225 Difference]: With dead ends: 45 [2021-12-27 23:49:52,389 INFO L226 Difference]: Without dead ends: 43 [2021-12-27 23:49:52,390 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-27 23:49:52,391 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-27 23:49:52,393 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-27 23:49:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-27 23:49:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2021-12-27 23:49:52,399 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-27 23:49:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2021-12-27 23:49:52,401 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2021-12-27 23:49:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:52,402 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-12-27 23:49:52,402 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-27 23:49:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2021-12-27 23:49:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-27 23:49:52,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:52,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:52,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 23:49:52,406 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-27 23:49:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:52,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2021-12-27 23:49:52,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:52,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357398970] [2021-12-27 23:49:52,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:52,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:52,551 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-27 23:49:52,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:52,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357398970] [2021-12-27 23:49:52,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357398970] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:52,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:52,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:49:52,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502129772] [2021-12-27 23:49:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:52,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:49:52,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:52,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:49:52,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:49:52,557 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-27 23:49:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:52,677 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2021-12-27 23:49:52,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:49:52,678 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-27 23:49:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:52,680 INFO L225 Difference]: With dead ends: 61 [2021-12-27 23:49:52,687 INFO L226 Difference]: Without dead ends: 50 [2021-12-27 23:49:52,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-27 23:49:52,689 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-27 23:49:52,690 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-27 23:49:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-27 23:49:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-27 23:49:52,700 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-27 23:49:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-12-27 23:49:52,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2021-12-27 23:49:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:52,702 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-12-27 23:49:52,702 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-27 23:49:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-12-27 23:49:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-27 23:49:52,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:52,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:52,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 23:49:52,703 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-27 23:49:52,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2021-12-27 23:49:52,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:52,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021768654] [2021-12-27 23:49:52,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:52,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:52,730 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-27 23:49:52,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:52,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021768654] [2021-12-27 23:49:52,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021768654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:52,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:52,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 23:49:52,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721701374] [2021-12-27 23:49:52,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:52,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 23:49:52,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 23:49:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 23:49:52,733 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-27 23:49:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:52,762 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-27 23:49:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 23:49:52,763 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-27 23:49:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:52,763 INFO L225 Difference]: With dead ends: 45 [2021-12-27 23:49:52,764 INFO L226 Difference]: Without dead ends: 43 [2021-12-27 23:49:52,764 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-27 23:49:52,765 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-27 23:49:52,765 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-27 23:49:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-27 23:49:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-12-27 23:49:52,768 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-27 23:49:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2021-12-27 23:49:52,768 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2021-12-27 23:49:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:52,768 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2021-12-27 23:49:52,769 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-27 23:49:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2021-12-27 23:49:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-27 23:49:52,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:52,769 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:52,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 23:49:52,770 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-27 23:49:52,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:52,770 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2021-12-27 23:49:52,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:52,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088776967] [2021-12-27 23:49:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:52,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:52,931 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-27 23:49:52,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:52,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088776967] [2021-12-27 23:49:52,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088776967] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:49:52,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297590603] [2021-12-27 23:49:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:52,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:52,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:52,934 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-27 23:49:52,944 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-27 23:49:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:53,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-27 23:49:53,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:53,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:53,203 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-27 23:49:53,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:53,234 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-27 23:49:53,255 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-27 23:49:53,256 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-27 23:49:53,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:53,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:53,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:53,266 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-27 23:49:53,279 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-27 23:49:53,295 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-27 23:49:53,295 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-27 23:49:53,305 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-27 23:49:53,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:53,437 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-27 23:49:53,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:53,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:53,451 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-27 23:49:53,452 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-27 23:49:53,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:53,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:53,597 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:53,598 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-27 23:49:53,614 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-27 23:49:53,615 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-27 23:49:53,632 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-27 23:49:53,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:49:53,807 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-27 23:49:53,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297590603] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:49:53,807 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:49:53,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-12-27 23:49:53,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877529384] [2021-12-27 23:49:53,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:49:53,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-27 23:49:53,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:53,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-27 23:49:53,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-12-27 23:49:53,809 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-27 23:49:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:54,120 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2021-12-27 23:49:54,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 23:49:54,120 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-27 23:49:54,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:54,121 INFO L225 Difference]: With dead ends: 64 [2021-12-27 23:49:54,121 INFO L226 Difference]: Without dead ends: 53 [2021-12-27 23:49:54,121 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-27 23:49:54,122 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-27 23:49:54,122 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-27 23:49:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-27 23:49:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2021-12-27 23:49:54,125 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-27 23:49:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2021-12-27 23:49:54,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2021-12-27 23:49:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:54,125 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2021-12-27 23:49:54,125 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-27 23:49:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2021-12-27 23:49:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 23:49:54,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:54,126 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:54,147 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-27 23:49:54,335 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-27 23:49:54,335 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-27 23:49:54,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2021-12-27 23:49:54,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:54,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278500165] [2021-12-27 23:49:54,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:54,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:54,416 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-27 23:49:54,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:54,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278500165] [2021-12-27 23:49:54,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278500165] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:49:54,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076630726] [2021-12-27 23:49:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:54,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:54,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:54,424 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-27 23:49:54,425 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-27 23:49:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:54,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-27 23:49:54,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:54,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:54,562 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-27 23:49:54,580 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-27 23:49:54,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, 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-27 23:49:54,604 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-27 23:49:54,605 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-27 23:49:54,612 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-27 23:49:54,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:54,683 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-27 23:49:54,684 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-27 23:49:54,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:54,697 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-27 23:49:54,697 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-27 23:49:54,743 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-27 23:49:54,743 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-27 23:49:54,853 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-27 23:49:54,853 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-27 23:49:54,867 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-27 23:49:54,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:49:54,891 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-27 23:49:54,901 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-27 23:49:54,928 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-27 23:49:54,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076630726] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:49:54,929 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:49:54,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-27 23:49:54,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558682968] [2021-12-27 23:49:54,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:49:54,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-27 23:49:54,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:54,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-27 23:49:54,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2021-12-27 23:49:54,930 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-27 23:49:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:55,345 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2021-12-27 23:49:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 23:49:55,346 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-27 23:49:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:55,346 INFO L225 Difference]: With dead ends: 155 [2021-12-27 23:49:55,346 INFO L226 Difference]: Without dead ends: 153 [2021-12-27 23:49:55,347 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-27 23:49:55,347 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-27 23:49:55,347 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-27 23:49:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-27 23:49:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 71. [2021-12-27 23:49:55,352 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-27 23:49:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2021-12-27 23:49:55,353 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 16 [2021-12-27 23:49:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:55,353 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2021-12-27 23:49:55,353 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-27 23:49:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2021-12-27 23:49:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 23:49:55,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:55,353 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:55,379 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-27 23:49:55,567 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-27 23:49:55,567 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-27 23:49:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2021-12-27 23:49:55,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:55,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993181463] [2021-12-27 23:49:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:55,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:55,677 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-27 23:49:55,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:55,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993181463] [2021-12-27 23:49:55,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993181463] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:49:55,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851175719] [2021-12-27 23:49:55,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:49:55,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:55,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:55,679 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-27 23:49:55,680 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-27 23:49:55,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 23:49:55,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:49:55,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-27 23:49:55,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:56,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,013 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-27 23:49:56,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,019 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-27 23:49:56,032 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-27 23:49:56,033 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-27 23:49:56,117 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-27 23:49:56,118 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-27 23:49:56,124 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-27 23:49:56,141 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-27 23:49:56,141 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-27 23:49:56,164 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-27 23:49:56,249 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-27 23:49:56,269 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-27 23:49:56,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:49:56,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851175719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:56,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 23:49:56,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-12-27 23:49:56,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138831820] [2021-12-27 23:49:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:56,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:49:56,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:49:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-27 23:49:56,271 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-27 23:49:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:56,445 INFO L93 Difference]: Finished difference Result 138 states and 171 transitions. [2021-12-27 23:49:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:49:56,445 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-27 23:49:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:56,446 INFO L225 Difference]: With dead ends: 138 [2021-12-27 23:49:56,446 INFO L226 Difference]: Without dead ends: 103 [2021-12-27 23:49:56,446 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-27 23:49:56,446 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-27 23:49:56,447 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-27 23:49:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-27 23:49:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2021-12-27 23:49:56,451 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-27 23:49:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2021-12-27 23:49:56,451 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 18 [2021-12-27 23:49:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:56,451 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2021-12-27 23:49:56,452 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-27 23:49:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-12-27 23:49:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 23:49:56,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:56,452 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:56,477 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-27 23:49:56,652 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-27 23:49:56,653 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-27 23:49:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2021-12-27 23:49:56,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:56,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003458094] [2021-12-27 23:49:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:56,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:56,759 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-27 23:49:56,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:56,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003458094] [2021-12-27 23:49:56,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003458094] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:49:56,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771090872] [2021-12-27 23:49:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:56,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:56,761 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-27 23:49:56,761 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-27 23:49:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:56,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-27 23:49:56,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:56,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,921 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-27 23:49:56,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,928 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-27 23:49:56,948 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-27 23:49:56,948 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-27 23:49:56,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,956 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-27 23:49:56,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,965 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-27 23:49:56,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:56,975 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-27 23:49:56,998 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-27 23:49:56,998 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-27 23:49:57,006 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-27 23:49:57,013 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-27 23:49:57,113 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-27 23:49:57,113 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-27 23:49:57,120 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-27 23:49:57,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:57,137 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-27 23:49:57,138 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-27 23:49:57,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:57,151 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-27 23:49:57,151 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-27 23:49:57,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:57,170 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-27 23:49:57,282 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-27 23:49:57,283 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-27 23:49:57,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:57,287 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-27 23:49:57,307 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-27 23:49:57,544 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-27 23:49:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:57,596 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-27 23:49:57,658 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:49:57,659 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-27 23:49:57,666 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-27 23:49:57,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:49:57,771 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-27 23:49:57,788 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:57,788 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-27 23:49:57,903 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-27 23:49:57,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771090872] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:49:57,904 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:49:57,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2021-12-27 23:49:57,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349028180] [2021-12-27 23:49:57,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:49:57,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-27 23:49:57,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:57,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-27 23:49:57,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=280, Unknown=3, NotChecked=34, Total=380 [2021-12-27 23:49:57,906 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-27 23:49:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:58,593 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2021-12-27 23:49:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 23:49:58,593 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-27 23:49:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:58,594 INFO L225 Difference]: With dead ends: 159 [2021-12-27 23:49:58,594 INFO L226 Difference]: Without dead ends: 109 [2021-12-27 23:49:58,595 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-27 23:49:58,595 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-27 23:49:58,595 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-27 23:49:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-27 23:49:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2021-12-27 23:49:58,600 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-27 23:49:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2021-12-27 23:49:58,601 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 19 [2021-12-27 23:49:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:58,601 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2021-12-27 23:49:58,601 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-27 23:49:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2021-12-27 23:49:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-27 23:49:58,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:58,602 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:58,621 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-27 23:49:58,819 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-27 23:49:58,819 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-27 23:49:58,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:58,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2021-12-27 23:49:58,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:58,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755728063] [2021-12-27 23:49:58,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:58,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:58,997 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-27 23:49:58,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:58,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755728063] [2021-12-27 23:49:58,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755728063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:49:58,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594220896] [2021-12-27 23:49:58,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:49:58,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:58,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:58,999 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-27 23:49:59,000 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-27 23:49:59,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 23:49:59,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:49:59,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-27 23:49:59,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:59,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:59,376 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-27 23:49:59,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:59,381 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-27 23:49:59,403 INFO L353 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2021-12-27 23:49:59,403 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-27 23:49:59,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:59,426 INFO L353 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2021-12-27 23:49:59,427 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-27 23:49:59,431 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-27 23:49:59,436 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-27 23:49:59,444 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-27 23:49:59,450 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-27 23:49:59,455 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-27 23:49:59,474 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-27 23:49:59,488 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-27 23:49:59,535 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-27 23:49:59,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:59,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:59,911 INFO L353 Elim1Store]: treesize reduction 196, result has 28.5 percent of original size [2021-12-27 23:49:59,911 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 247 [2021-12-27 23:49:59,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:59,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:59,954 INFO L353 Elim1Store]: treesize reduction 136, result has 21.8 percent of original size [2021-12-27 23:49:59,954 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 260 treesize of output 221 [2021-12-27 23:50:03,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:03,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:50:03,586 INFO L353 Elim1Store]: treesize reduction 275, result has 11.0 percent of original size [2021-12-27 23:50:03,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 58 case distinctions, treesize of input 383 treesize of output 257 [2021-12-27 23:50:03,676 INFO L353 Elim1Store]: treesize reduction 335, result has 13.0 percent of original size [2021-12-27 23:50:03,676 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 8 new quantified variables, introduced 36 case distinctions, treesize of input 291 treesize of output 284 [2021-12-27 23:50:07,678 INFO L353 Elim1Store]: treesize reduction 165, result has 66.0 percent of original size [2021-12-27 23:50:07,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 1 disjoint index pairs (out of 91 index pairs), introduced 19 new quantified variables, introduced 90 case distinctions, treesize of input 504 treesize of output 526 [2021-12-27 23:50:07,712 INFO L353 Elim1Store]: treesize reduction 110, result has 2.7 percent of original size [2021-12-27 23:50:07,713 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 8 new quantified variables, introduced 21 case distinctions, treesize of input 540 treesize of output 486 [2021-12-27 23:50:11,606 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-27 23:50:11,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:50:12,267 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-27 23:50:12,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594220896] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:50:12,268 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:50:12,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2021-12-27 23:50:12,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896844288] [2021-12-27 23:50:12,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:50:12,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-27 23:50:12,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:50:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-27 23:50:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2021-12-27 23:50:12,271 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-27 23:50:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:50:12,807 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2021-12-27 23:50:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 23:50:12,808 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-27 23:50:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:50:12,808 INFO L225 Difference]: With dead ends: 107 [2021-12-27 23:50:12,809 INFO L226 Difference]: Without dead ends: 96 [2021-12-27 23:50:12,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2021-12-27 23:50:12,809 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:50:12,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 314 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 124 Unchecked, 0.0s Time] [2021-12-27 23:50:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-27 23:50:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2021-12-27 23:50:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 94 states have internal predecessors, (112), 0 states have call successors, (0), 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-27 23:50:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2021-12-27 23:50:12,815 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 20 [2021-12-27 23:50:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:50:12,816 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2021-12-27 23:50:12,816 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-27 23:50:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2021-12-27 23:50:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 23:50:12,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:50:12,817 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:50:12,835 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-27 23:50:13,034 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-27 23:50:13,035 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-27 23:50:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:50:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2021-12-27 23:50:13,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:50:13,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105918383] [2021-12-27 23:50:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:50:13,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:50:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:50:13,149 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-27 23:50:13,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:50:13,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105918383] [2021-12-27 23:50:13,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105918383] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:50:13,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867409260] [2021-12-27 23:50:13,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:50:13,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:50:13,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:50:13,151 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-27 23:50:13,151 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-27 23:50:13,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 23:50:13,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:50:13,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-27 23:50:13,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:50:13,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:13,567 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-27 23:50:13,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:13,572 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-27 23:50:13,587 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-27 23:50:13,588 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-27 23:50:13,592 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-27 23:50:13,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:13,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:13,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:13,599 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-27 23:50:13,619 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-27 23:50:13,619 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-27 23:50:13,631 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-27 23:50:13,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:13,689 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-27 23:50:13,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:13,693 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-27 23:50:13,705 INFO L353 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-27 23:50:13,706 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-27 23:50:13,713 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-27 23:50:13,755 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-27 23:50:13,758 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-27 23:50:13,766 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-27 23:50:13,892 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-27 23:50:13,894 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-27 23:50:13,916 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-27 23:50:13,934 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-27 23:50:13,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:50:14,018 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-27 23:50:14,027 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:50:14,027 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-27 23:50:14,121 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-27 23:50:14,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867409260] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:50:14,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:50:14,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-12-27 23:50:14,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197049192] [2021-12-27 23:50:14,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:50:14,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-27 23:50:14,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:50:14,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-27 23:50:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=291, Unknown=1, NotChecked=34, Total=380 [2021-12-27 23:50:14,123 INFO L87 Difference]: Start difference. First operand 95 states and 112 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-27 23:50:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:50:14,547 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2021-12-27 23:50:14,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:50:14,547 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-27 23:50:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:50:14,548 INFO L225 Difference]: With dead ends: 158 [2021-12-27 23:50:14,548 INFO L226 Difference]: Without dead ends: 123 [2021-12-27 23:50:14,549 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-27 23:50:14,549 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 23:50:14,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 263 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 263 Invalid, 0 Unknown, 113 Unchecked, 0.3s Time] [2021-12-27 23:50:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-27 23:50:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2021-12-27 23:50:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 95 states have (on average 1.2) internal successors, (114), 96 states have internal predecessors, (114), 0 states have call successors, (0), 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-27 23:50:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2021-12-27 23:50:14,554 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 21 [2021-12-27 23:50:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:50:14,554 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2021-12-27 23:50:14,555 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-27 23:50:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2021-12-27 23:50:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 23:50:14,555 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:50:14,555 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:50:14,573 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-27 23:50:14,755 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-27 23:50:14,756 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-27 23:50:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:50:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2021-12-27 23:50:14,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:50:14,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160765220] [2021-12-27 23:50:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:50:14,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:50:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:50:14,911 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-27 23:50:14,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:50:14,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160765220] [2021-12-27 23:50:14,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160765220] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:50:14,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407313907] [2021-12-27 23:50:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:50:14,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:50:14,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:50:14,913 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-27 23:50:14,924 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-27 23:50:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:50:15,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-27 23:50:15,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:50:15,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,098 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-27 23:50:15,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,105 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-27 23:50:15,125 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-27 23:50:15,126 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-27 23:50:15,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,140 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-27 23:50:15,163 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-27 23:50:15,163 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-27 23:50:15,170 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-27 23:50:15,178 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-27 23:50:15,182 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-27 23:50:15,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,284 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-27 23:50:15,284 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-27 23:50:15,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,292 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-27 23:50:15,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,297 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-27 23:50:15,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,313 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-27 23:50:15,314 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-27 23:50:15,408 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-27 23:50:15,408 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-27 23:50:15,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:50:15,413 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-27 23:50:15,417 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-27 23:50:15,771 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-27 23:50:15,772 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-27 23:50:15,781 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-27 23:50:15,782 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-27 23:50:15,823 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-27 23:50:15,855 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-27 23:50:15,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:50:15,929 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-27 23:50:15,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:50:15,938 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-27 23:50:16,043 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-27 23:50:16,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407313907] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:50:16,044 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:50:16,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2021-12-27 23:50:16,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668403734] [2021-12-27 23:50:16,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:50:16,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-27 23:50:16,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:50:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-27 23:50:16,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2021-12-27 23:50:16,045 INFO L87 Difference]: Start difference. First operand 97 states and 114 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-27 23:50:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:50:16,770 INFO L93 Difference]: Finished difference Result 165 states and 200 transitions. [2021-12-27 23:50:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 23:50:16,770 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-27 23:50:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:50:16,771 INFO L225 Difference]: With dead ends: 165 [2021-12-27 23:50:16,771 INFO L226 Difference]: Without dead ends: 130 [2021-12-27 23:50:16,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=607, Unknown=1, NotChecked=52, Total=812 [2021-12-27 23:50:16,772 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 129 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-27 23:50:16,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 311 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 442 Invalid, 0 Unknown, 92 Unchecked, 0.4s Time] [2021-12-27 23:50:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-27 23:50:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 99. [2021-12-27 23:50:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 98 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:50:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2021-12-27 23:50:16,787 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 21 [2021-12-27 23:50:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:50:16,787 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2021-12-27 23:50:16,787 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-27 23:50:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2021-12-27 23:50:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 23:50:16,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:50:16,788 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-27 23:50:16,810 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-27 23:50:16,999 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-27 23:50:17,000 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-27 23:50:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:50:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2021-12-27 23:50:17,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:50:17,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38987546] [2021-12-27 23:50:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:50:17,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:50:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 23:50:17,024 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-27 23:50:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 23:50:17,054 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-27 23:50:17,054 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-27 23:50:17,055 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-12-27 23:50:17,056 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-12-27 23:50:17,056 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-12-27 23:50:17,056 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-12-27 23:50:17,056 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-12-27 23:50:17,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-27 23:50:17,059 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-27 23:50:17,061 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 23:50:17,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:50:17 BoogieIcfgContainer [2021-12-27 23:50:17,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 23:50:17,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 23:50:17,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 23:50:17,098 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 23:50:17,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:49:51" (3/4) ... [2021-12-27 23:50:17,100 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-27 23:50:17,136 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-27 23:50:17,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 23:50:17,137 INFO L158 Benchmark]: Toolchain (without parser) took 26214.81ms. Allocated memory was 58.7MB in the beginning and 237.0MB in the end (delta: 178.3MB). Free memory was 35.8MB in the beginning and 184.3MB in the end (delta: -148.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2021-12-27 23:50:17,137 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 40.4MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:50:17,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.83ms. Allocated memory is still 58.7MB. Free memory was 35.6MB in the beginning and 34.6MB in the end (delta: 1.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-27 23:50:17,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.02ms. Allocated memory is still 58.7MB. Free memory was 34.4MB in the beginning and 32.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:50:17,138 INFO L158 Benchmark]: Boogie Preprocessor took 21.05ms. Allocated memory is still 58.7MB. Free memory was 32.4MB in the beginning and 30.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:50:17,138 INFO L158 Benchmark]: RCFGBuilder took 469.07ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 30.4MB in the beginning and 44.7MB in the end (delta: -14.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2021-12-27 23:50:17,138 INFO L158 Benchmark]: TraceAbstraction took 25316.60ms. Allocated memory was 77.6MB in the beginning and 237.0MB in the end (delta: 159.4MB). Free memory was 44.2MB in the beginning and 186.4MB in the end (delta: -142.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2021-12-27 23:50:17,139 INFO L158 Benchmark]: Witness Printer took 38.50ms. Allocated memory is still 237.0MB. Free memory was 186.4MB in the beginning and 184.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:50:17,143 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 40.4MB in the beginning and 40.4MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.83ms. Allocated memory is still 58.7MB. Free memory was 35.6MB in the beginning and 34.6MB in the end (delta: 1.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.02ms. Allocated memory is still 58.7MB. Free memory was 34.4MB in the beginning and 32.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.05ms. Allocated memory is still 58.7MB. Free memory was 32.4MB in the beginning and 30.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.07ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 30.4MB in the beginning and 44.7MB in the end (delta: -14.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25316.60ms. Allocated memory was 77.6MB in the beginning and 237.0MB in the end (delta: 159.4MB). Free memory was 44.2MB in the beginning and 186.4MB in the end (delta: -142.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 38.50ms. Allocated memory is still 237.0MB. Free memory was 186.4MB in the beginning and 184.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1061]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1004] BCK* bucket = malloc(sizeof(BCK)); [L1005] bucket->data = 0 [L1006] bucket->list = ((void*)0) [L1008] bucket->next = malloc(sizeof(BCK)) [L1009] EXPR bucket->next [L1009] BCK* bcki = bucket->next; [L1010] bcki->data = 1 [L1011] bcki->list = ((void*)0) [L1013] bcki->next = malloc(sizeof(BCK)) [L1014] EXPR bcki->next [L1014] bcki = bcki->next [L1015] bcki->data = 2 [L1016] bcki->list = ((void*)0) [L1017] bcki->next = ((void*)0) [L1019] struct TSLL* item = ((void*)0); [L1020] struct TSLL* itr = ((void*)0); VAL [bcki={-1:0}, bucket={-3:0}, item={0:0}, itr={0:0}] [L1021] COND TRUE __VERIFIER_nondet_int() [L1023] item = malloc(sizeof(SLL)) [L1024] item->next = ((void*)0) [L1025] COND TRUE __VERIFIER_nondet_int() [L1026] item->data = 0 VAL [bcki={-1:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1032] bcki = bucket VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1034] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1035] COND FALSE !(!(item != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1036] EXPR bcki->data [L1036] EXPR item->data VAL [bcki={-3:0}, bcki->data=0, bucket={-3:0}, item={-4:0}, item->data=0, itr={0:0}] [L1036] COND FALSE !(bcki->data != item->data) [L1038] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1040] EXPR bcki->list VAL [bcki={-3:0}, bcki->list={0:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1040] COND TRUE bcki->list == ((void*)0) [L1041] bcki->list = item VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1052] bcki = bucket VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1053] COND TRUE bcki != ((void*)0) [L1055] EXPR bcki->list [L1055] item = bcki->list [L1056] bcki->list = ((void*)0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}, itr={0:0}] [L1057] COND TRUE item != ((void*)0) [L1059] itr = item [L1060] EXPR item->next [L1060] item = item->next [L1061] EXPR itr->data [L1061] EXPR bcki->data VAL [bcki={-3:0}, bcki->data=0, bucket={-3:0}, item={0:0}, itr={-4:0}, itr->data=0] [L1061] COND TRUE !(itr->data != bcki->data) [L1061] reach_error() VAL [bcki={-3:0}, bucket={-3:0}, item={0:0}, itr={-4:0}] - UnprovableResult [Line: 1034]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 860 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 860 mSDsluCounter, 2123 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 663 IncrementalHoareTripleChecker+Unchecked, 1737 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1690 IncrementalHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 386 mSDtfsCounter, 1690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 188 SyntacticMatches, 5 SemanticMatches, 167 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=11, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 231 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 385 ConstructedInterpolants, 51 QuantifiedInterpolants, 17760 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1807 ConjunctsInSsa, 485 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 54/141 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-27 23:50:17,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE