./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:39:02,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:39:02,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:39:02,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:39:02,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:39:02,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:39:02,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:39:02,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:39:02,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:39:02,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:39:02,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:39:02,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:39:02,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:39:02,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:39:02,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:39:02,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:39:02,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:39:02,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:39:02,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:39:02,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:39:02,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:39:02,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:39:02,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:39:02,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:39:02,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:39:02,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:39:02,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:39:02,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:39:02,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:39:02,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:39:02,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:39:02,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:39:02,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:39:02,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:39:02,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:39:02,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:39:02,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:39:02,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:39:02,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:39:02,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:39:02,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:39:02,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:39:02,467 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:39:02,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:39:02,468 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:39:02,468 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:39:02,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:39:02,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:39:02,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:39:02,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:39:02,470 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:39:02,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:39:02,470 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:39:02,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:39:02,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:39:02,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:39:02,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:39:02,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:39:02,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:39:02,471 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:39:02,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:39:02,472 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:39:02,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:39:02,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:39:02,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:39:02,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:39:02,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:39:02,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:39:02,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:39:02,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:39:02,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:39:02,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:39:02,474 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:39:02,474 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:39:02,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:39:02,474 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:39:02,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2021-12-14 13:39:02,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:39:02,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:39:02,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:39:02,673 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:39:02,674 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:39:02,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-14 13:39:02,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43684d534/129cc87195e44364a146a283c588bfe2/FLAG8406e10d6 [2021-12-14 13:39:03,120 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:39:03,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-14 13:39:03,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43684d534/129cc87195e44364a146a283c588bfe2/FLAG8406e10d6 [2021-12-14 13:39:03,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43684d534/129cc87195e44364a146a283c588bfe2 [2021-12-14 13:39:03,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:39:03,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:39:03,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:39:03,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:39:03,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:39:03,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a787af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03, skipping insertion in model container [2021-12-14 13:39:03,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:39:03,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:39:03,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-14 13:39:03,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2021-12-14 13:39:03,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2021-12-14 13:39:03,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2021-12-14 13:39:03,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2021-12-14 13:39:03,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:39:03,389 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:39:03,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-14 13:39:03,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2021-12-14 13:39:03,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2021-12-14 13:39:03,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2021-12-14 13:39:03,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2021-12-14 13:39:03,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:39:03,431 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:39:03,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03 WrapperNode [2021-12-14 13:39:03,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:39:03,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:39:03,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:39:03,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:39:03,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,464 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2021-12-14 13:39:03,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:39:03,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:39:03,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:39:03,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:39:03,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:39:03,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:39:03,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:39:03,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:39:03,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (1/1) ... [2021-12-14 13:39:03,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:39:03,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:03,540 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-14 13:39:03,546 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-14 13:39:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:39:03,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:39:03,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:39:03,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:39:03,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:39:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:39:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:39:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:39:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:39:03,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:39:03,674 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:39:03,683 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:39:03,903 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:39:03,910 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:39:03,910 INFO L301 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-14 13:39:03,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:39:03 BoogieIcfgContainer [2021-12-14 13:39:03,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:39:03,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:39:03,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:39:03,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:39:03,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:39:03" (1/3) ... [2021-12-14 13:39:03,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c0d41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:39:03, skipping insertion in model container [2021-12-14 13:39:03,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:39:03" (2/3) ... [2021-12-14 13:39:03,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c0d41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:39:03, skipping insertion in model container [2021-12-14 13:39:03,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:39:03" (3/3) ... [2021-12-14 13:39:03,918 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2021-12-14 13:39:03,921 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:39:03,924 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-12-14 13:39:03,966 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:39:03,972 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-14 13:39:03,972 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-14 13:39:03,983 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-14 13:39:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 13:39:03,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:03,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:03,996 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-14 13:39:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2021-12-14 13:39:04,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:04,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517683644] [2021-12-14 13:39:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:04,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:04,256 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-14 13:39:04,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:04,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517683644] [2021-12-14 13:39:04,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517683644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:39:04,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:39:04,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:39:04,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122175789] [2021-12-14 13:39:04,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:39:04,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:39:04,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:04,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:39:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:39:04,315 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-14 13:39:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:04,395 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2021-12-14 13:39:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:39:04,397 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-14 13:39:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:04,402 INFO L225 Difference]: With dead ends: 112 [2021-12-14 13:39:04,402 INFO L226 Difference]: Without dead ends: 66 [2021-12-14 13:39:04,404 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-14 13:39:04,406 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-14 13:39:04,406 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-14 13:39:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-14 13:39:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2021-12-14 13:39:04,428 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-14 13:39:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2021-12-14 13:39:04,429 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2021-12-14 13:39:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:04,430 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2021-12-14 13:39:04,430 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-14 13:39:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-12-14 13:39:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 13:39:04,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:04,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:04,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:39:04,431 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-14 13:39:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2021-12-14 13:39:04,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:04,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035392780] [2021-12-14 13:39:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:04,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:04,479 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-14 13:39:04,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:04,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035392780] [2021-12-14 13:39:04,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035392780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:39:04,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:39:04,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:39:04,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80840372] [2021-12-14 13:39:04,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:39:04,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:39:04,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:39:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:39:04,485 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-14 13:39:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:04,504 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-14 13:39:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:39:04,504 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-14 13:39:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:04,505 INFO L225 Difference]: With dead ends: 45 [2021-12-14 13:39:04,505 INFO L226 Difference]: Without dead ends: 43 [2021-12-14 13:39:04,505 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-14 13:39:04,506 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-14 13:39:04,506 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-14 13:39:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-14 13:39:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2021-12-14 13:39:04,509 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-14 13:39:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2021-12-14 13:39:04,510 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2021-12-14 13:39:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:04,510 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-12-14 13:39:04,511 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-14 13:39:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2021-12-14 13:39:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 13:39:04,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:04,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:04,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:39:04,512 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-14 13:39:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2021-12-14 13:39:04,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:04,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016003429] [2021-12-14 13:39:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:04,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:04,613 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-14 13:39:04,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:04,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016003429] [2021-12-14 13:39:04,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016003429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:39:04,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:39:04,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:39:04,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959302983] [2021-12-14 13:39:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:39:04,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:39:04,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:39:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:39:04,618 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-14 13:39:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:04,740 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2021-12-14 13:39:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:39:04,741 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-14 13:39:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:04,742 INFO L225 Difference]: With dead ends: 61 [2021-12-14 13:39:04,743 INFO L226 Difference]: Without dead ends: 50 [2021-12-14 13:39:04,743 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-14 13:39:04,744 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:04,744 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-14 13:39:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-14 13:39:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-14 13:39:04,748 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-14 13:39:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-12-14 13:39:04,749 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2021-12-14 13:39:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:04,749 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-12-14 13:39:04,749 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-14 13:39:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-12-14 13:39:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 13:39:04,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:04,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:04,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:39:04,750 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-14 13:39:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2021-12-14 13:39:04,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:04,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272964479] [2021-12-14 13:39:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:04,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:04,780 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-14 13:39:04,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272964479] [2021-12-14 13:39:04,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272964479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:39:04,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:39:04,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:39:04,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213552882] [2021-12-14 13:39:04,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:39:04,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:39:04,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:39:04,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:39:04,782 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-14 13:39:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:04,871 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2021-12-14 13:39:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:39:04,871 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-14 13:39:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:04,872 INFO L225 Difference]: With dead ends: 45 [2021-12-14 13:39:04,872 INFO L226 Difference]: Without dead ends: 43 [2021-12-14 13:39:04,872 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-14 13:39:04,873 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:04,873 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.1s Time] [2021-12-14 13:39:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-14 13:39:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-12-14 13:39:04,877 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-14 13:39:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2021-12-14 13:39:04,878 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2021-12-14 13:39:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:04,878 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2021-12-14 13:39:04,878 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-14 13:39:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2021-12-14 13:39:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 13:39:04,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:04,879 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:04,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:39:04,879 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-14 13:39:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2021-12-14 13:39:04,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:04,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055744148] [2021-12-14 13:39:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:04,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:05,087 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-14 13:39:05,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:05,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055744148] [2021-12-14 13:39:05,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055744148] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943873260] [2021-12-14 13:39:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:05,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:05,092 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-14 13:39:05,093 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-14 13:39:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:05,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-14 13:39:05,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:05,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,302 INFO L388 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-14 13:39:05,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,313 INFO L388 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-14 13:39:05,367 INFO L354 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-14 13:39:05,367 INFO L388 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-14 13:39:05,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,376 INFO L388 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-14 13:39:05,383 INFO L388 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-14 13:39:05,397 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:39:05,397 INFO L388 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-14 13:39:05,432 INFO L388 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-14 13:39:05,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:05,564 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-14 13:39:05,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 62 [2021-12-14 13:39:05,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,574 INFO L388 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-14 13:39:05,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:05,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:05,718 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:39:05,719 INFO L388 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 96 treesize of output 52 [2021-12-14 13:39:05,729 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-14 13:39:05,729 INFO L388 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-14 13:39:05,748 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-14 13:39:05,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:39:05,932 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-14 13:39:05,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943873260] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:39:05,933 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:39:05,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2021-12-14 13:39:05,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562011195] [2021-12-14 13:39:05,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:39:05,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 13:39:05,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:05,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 13:39:05,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-12-14 13:39:05,935 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-14 13:39:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:06,391 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2021-12-14 13:39:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:39:06,392 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-14 13:39:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:06,393 INFO L225 Difference]: With dead ends: 64 [2021-12-14 13:39:06,393 INFO L226 Difference]: Without dead ends: 53 [2021-12-14 13:39:06,394 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-14 13:39:06,394 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:06,395 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.3s Time] [2021-12-14 13:39:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-14 13:39:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2021-12-14 13:39:06,399 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-14 13:39:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2021-12-14 13:39:06,400 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2021-12-14 13:39:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:06,401 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2021-12-14 13:39:06,401 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-14 13:39:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2021-12-14 13:39:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:39:06,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:06,402 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:06,436 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-14 13:39:06,624 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-14 13:39:06,625 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-14 13:39:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2021-12-14 13:39:06,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:06,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942712762] [2021-12-14 13:39:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:06,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:39:06,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:06,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942712762] [2021-12-14 13:39:06,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942712762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:06,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328475477] [2021-12-14 13:39:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:06,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:06,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:06,685 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-14 13:39:06,687 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-14 13:39:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:06,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-14 13:39:06,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:06,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:06,805 INFO L388 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 22 treesize of output 26 [2021-12-14 13:39:06,819 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-14 13:39:06,819 INFO L388 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 65 treesize of output 64 [2021-12-14 13:39:06,834 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-14 13:39:06,835 INFO L388 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-14 13:39:06,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:06,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-14 13:39:06,881 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-14 13:39:06,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-14 13:39:06,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 13:39:06,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-14 13:39:06,982 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-14 13:39:06,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:39:07,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2021-12-14 13:39:07,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_23| Int) (v_ArrVal_670 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_23|) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_23| v_ArrVal_670) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) is different from false [2021-12-14 13:39:07,080 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-14 13:39:07,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328475477] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:39:07,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:39:07,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-12-14 13:39:07,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365281614] [2021-12-14 13:39:07,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:39:07,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:39:07,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:07,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:39:07,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2021-12-14 13:39:07,085 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-14 13:39:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:07,391 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2021-12-14 13:39:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:39:07,391 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-14 13:39:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:07,392 INFO L225 Difference]: With dead ends: 126 [2021-12-14 13:39:07,392 INFO L226 Difference]: Without dead ends: 124 [2021-12-14 13:39:07,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=183, Unknown=2, NotChecked=62, Total=342 [2021-12-14 13:39:07,394 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 242 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:07,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 245 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 174 Invalid, 0 Unknown, 166 Unchecked, 0.2s Time] [2021-12-14 13:39:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-14 13:39:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 62. [2021-12-14 13:39:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 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-14 13:39:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2021-12-14 13:39:07,400 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 16 [2021-12-14 13:39:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:07,401 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2021-12-14 13:39:07,401 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-14 13:39:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2021-12-14 13:39:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:39:07,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:07,402 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:07,427 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-14 13:39:07,603 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-14 13:39:07,604 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-14 13:39:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2021-12-14 13:39:07,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:07,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398800946] [2021-12-14 13:39:07,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:07,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:07,731 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-14 13:39:07,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:07,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398800946] [2021-12-14 13:39:07,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398800946] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:07,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871764751] [2021-12-14 13:39:07,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:39:07,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:07,733 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-14 13:39:07,734 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-14 13:39:08,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:39:08,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:39:08,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-14 13:39:08,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:08,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:08,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:08,139 INFO L388 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-14 13:39:08,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:08,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:08,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:08,144 INFO L388 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-14 13:39:08,162 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-14 13:39:08,162 INFO L388 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-14 13:39:08,270 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:39:08,271 INFO L388 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-14 13:39:08,276 INFO L388 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-14 13:39:08,293 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-12-14 13:39:08,293 INFO L388 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-14 13:39:08,315 INFO L388 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-14 13:39:08,405 INFO L388 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-14 13:39:08,425 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-14 13:39:08,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:39:08,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871764751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:39:08,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:39:08,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-12-14 13:39:08,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854193335] [2021-12-14 13:39:08,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:39:08,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:39:08,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:08,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:39:08,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:39:08,427 INFO L87 Difference]: Start difference. First operand 62 states and 76 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-14 13:39:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:08,636 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2021-12-14 13:39:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:39:08,637 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-14 13:39:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:08,638 INFO L225 Difference]: With dead ends: 142 [2021-12-14 13:39:08,638 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 13:39:08,638 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-14 13:39:08,638 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:08,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 131 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2021-12-14 13:39:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 13:39:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2021-12-14 13:39:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.25) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:39:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2021-12-14 13:39:08,643 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 18 [2021-12-14 13:39:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:08,643 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2021-12-14 13:39:08,644 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-14 13:39:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2021-12-14 13:39:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:39:08,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:08,644 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:08,663 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-14 13:39:08,844 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-14 13:39:08,845 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-14 13:39:08,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2021-12-14 13:39:08,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:08,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732591456] [2021-12-14 13:39:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:08,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:08,955 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-14 13:39:08,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:08,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732591456] [2021-12-14 13:39:08,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732591456] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:08,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155590362] [2021-12-14 13:39:08,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:08,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:08,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:08,957 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-14 13:39:08,959 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-14 13:39:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:09,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-14 13:39:09,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:09,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:09,081 INFO L388 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-14 13:39:09,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:09,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2021-12-14 13:39:09,100 INFO L354 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-14 13:39:09,101 INFO L388 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 76 treesize of output 75 [2021-12-14 13:39:09,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:09,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:09,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:09,107 INFO L388 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 30 treesize of output 32 [2021-12-14 13:39:09,126 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-14 13:39:09,126 INFO L388 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-14 13:39:09,135 INFO L388 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-14 13:39:09,198 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:39:09,199 INFO L388 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 23 treesize of output 27 [2021-12-14 13:39:09,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:09,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-14 13:39:09,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:09,219 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-14 13:39:09,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 55 [2021-12-14 13:39:09,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:09,239 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-14 13:39:09,239 INFO L388 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-14 13:39:09,318 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-14 13:39:09,319 INFO L388 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 67 treesize of output 53 [2021-12-14 13:39:09,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-14 13:39:09,439 INFO L388 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 22 treesize of output 10 [2021-12-14 13:39:09,491 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:39:09,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2021-12-14 13:39:09,497 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-14 13:39:09,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:39:09,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1038))) (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_1037) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2021-12-14 13:39:09,556 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_25|) 0)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_25| v_ArrVal_1038))) (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| |v_ULTIMATE.start_main_~item~0#1.base_25| v_ArrVal_1037) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0)))) is different from false [2021-12-14 13:39:09,580 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-14 13:39:09,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155590362] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:39:09,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:39:09,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-12-14 13:39:09,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521600168] [2021-12-14 13:39:09,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:39:09,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 13:39:09,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:09,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 13:39:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=195, Unknown=2, NotChecked=58, Total=306 [2021-12-14 13:39:09,582 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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-14 13:39:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:10,069 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2021-12-14 13:39:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 13:39:10,069 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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-14 13:39:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:10,070 INFO L225 Difference]: With dead ends: 142 [2021-12-14 13:39:10,070 INFO L226 Difference]: Without dead ends: 140 [2021-12-14 13:39:10,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=500, Unknown=2, NotChecked=98, Total=756 [2021-12-14 13:39:10,071 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 210 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:10,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 250 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 296 Invalid, 0 Unknown, 211 Unchecked, 0.3s Time] [2021-12-14 13:39:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-14 13:39:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 95. [2021-12-14 13:39:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 94 states have internal predecessors, (118), 0 states have call successors, (0), 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-14 13:39:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2021-12-14 13:39:10,085 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 19 [2021-12-14 13:39:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:10,085 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2021-12-14 13:39:10,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 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-14 13:39:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2021-12-14 13:39:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 13:39:10,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:10,086 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:10,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:39:10,304 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-14 13:39:10,304 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-14 13:39:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2021-12-14 13:39:10,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:10,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167424080] [2021-12-14 13:39:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:10,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:10,556 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-14 13:39:10,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:10,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167424080] [2021-12-14 13:39:10,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167424080] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:10,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210007565] [2021-12-14 13:39:10,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:39:10,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:10,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:10,558 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-14 13:39:10,559 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-14 13:39:10,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:39:10,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:39:10,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-14 13:39:10,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:10,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:10,833 INFO L388 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-14 13:39:10,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:10,838 INFO L388 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-14 13:39:10,855 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-14 13:39:10,855 INFO L388 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 78 treesize of output 79 [2021-12-14 13:39:10,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:10,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:10,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:10,862 INFO L388 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 33 treesize of output 37 [2021-12-14 13:39:10,868 INFO L388 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-14 13:39:10,872 INFO L388 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 19 treesize of output 31 [2021-12-14 13:39:10,876 INFO L388 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-14 13:39:10,880 INFO L388 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 19 treesize of output 31 [2021-12-14 13:39:10,885 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-14 13:39:10,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2021-12-14 13:39:10,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:10,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:10,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2021-12-14 13:39:11,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:11,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:11,020 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 13:39:11,020 INFO L388 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 62 [2021-12-14 13:39:11,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:11,158 INFO L354 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2021-12-14 13:39:11,159 INFO L388 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 1 case distinctions, treesize of input 54 treesize of output 55 [2021-12-14 13:39:11,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:11,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:11,169 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 13:39:11,169 INFO L388 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 65 [2021-12-14 13:39:11,329 INFO L354 Elim1Store]: treesize reduction 61, result has 15.3 percent of original size [2021-12-14 13:39:11,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 78 [2021-12-14 13:39:11,341 INFO L354 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2021-12-14 13:39:11,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 27 [2021-12-14 13:39:11,361 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-14 13:39:11,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:39:18,846 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-14 13:39:18,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210007565] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:39:18,847 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:39:18,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 20 [2021-12-14 13:39:18,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395364647] [2021-12-14 13:39:18,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:39:18,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 13:39:18,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:18,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 13:39:18,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=318, Unknown=1, NotChecked=0, Total=380 [2021-12-14 13:39:18,849 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 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-14 13:39:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:19,338 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2021-12-14 13:39:19,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 13:39:19,338 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 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 20 [2021-12-14 13:39:19,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:19,339 INFO L225 Difference]: With dead ends: 125 [2021-12-14 13:39:19,339 INFO L226 Difference]: Without dead ends: 114 [2021-12-14 13:39:19,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=126, Invalid=523, Unknown=1, NotChecked=0, Total=650 [2021-12-14 13:39:19,340 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:19,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 366 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 207 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2021-12-14 13:39:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-14 13:39:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2021-12-14 13:39:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 99 states have internal predecessors, (123), 0 states have call successors, (0), 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-14 13:39:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2021-12-14 13:39:19,345 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 20 [2021-12-14 13:39:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:19,345 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2021-12-14 13:39:19,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 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-14 13:39:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2021-12-14 13:39:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 13:39:19,346 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:19,346 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:19,364 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-14 13:39:19,560 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-14 13:39:19,560 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-14 13:39:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2021-12-14 13:39:19,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:19,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023669844] [2021-12-14 13:39:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:19,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:19,728 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-14 13:39:19,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:19,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023669844] [2021-12-14 13:39:19,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023669844] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:19,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581572895] [2021-12-14 13:39:19,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:39:19,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:19,730 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-14 13:39:19,732 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-14 13:39:20,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:39:20,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:39:20,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-14 13:39:20,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:20,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:20,113 INFO L388 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-14 13:39:20,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:20,118 INFO L388 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-14 13:39:20,135 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-14 13:39:20,135 INFO L388 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 104 treesize of output 99 [2021-12-14 13:39:20,140 INFO L388 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-14 13:39:20,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:20,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:20,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:20,158 INFO L388 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-14 13:39:20,180 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-14 13:39:20,180 INFO L388 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-14 13:39:20,186 INFO L388 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-14 13:39:20,189 INFO L388 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-14 13:39:20,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:20,263 INFO L388 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 65 treesize of output 57 [2021-12-14 13:39:20,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:20,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:20,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2021-12-14 13:39:20,288 INFO L354 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-14 13:39:20,288 INFO L388 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-14 13:39:20,293 INFO L388 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-14 13:39:20,354 INFO L388 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 36 treesize of output 35 [2021-12-14 13:39:20,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2021-12-14 13:39:20,360 INFO L388 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-14 13:39:20,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2021-12-14 13:39:20,548 INFO L388 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-14 13:39:20,572 INFO L388 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-14 13:39:20,590 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-14 13:39:20,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:39:20,659 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1442 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (|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)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1442) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1441) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 1)) is different from false [2021-12-14 13:39:20,669 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:39:20,670 INFO L388 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-14 13:39:20,780 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-14 13:39:20,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581572895] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:39:20,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:39:20,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-12-14 13:39:20,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476228062] [2021-12-14 13:39:20,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:39:20,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 13:39:20,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 13:39:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=291, Unknown=1, NotChecked=34, Total=380 [2021-12-14 13:39:20,781 INFO L87 Difference]: Start difference. First operand 100 states and 123 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-14 13:39:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:21,448 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2021-12-14 13:39:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:39:21,449 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-14 13:39:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:21,449 INFO L225 Difference]: With dead ends: 180 [2021-12-14 13:39:21,450 INFO L226 Difference]: Without dead ends: 145 [2021-12-14 13:39:21,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=489, Unknown=1, NotChecked=46, Total=650 [2021-12-14 13:39:21,451 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 102 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:21,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 296 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 316 Invalid, 0 Unknown, 129 Unchecked, 0.5s Time] [2021-12-14 13:39:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-14 13:39:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2021-12-14 13:39:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 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-14 13:39:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2021-12-14 13:39:21,456 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 21 [2021-12-14 13:39:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:21,456 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2021-12-14 13:39:21,457 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-14 13:39:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2021-12-14 13:39:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 13:39:21,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:21,457 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:21,484 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-14 13:39:21,665 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-14 13:39:21,665 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-14 13:39:21,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2021-12-14 13:39:21,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:21,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751297724] [2021-12-14 13:39:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:21,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:21,806 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-14 13:39:21,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:21,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751297724] [2021-12-14 13:39:21,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751297724] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:21,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811031859] [2021-12-14 13:39:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:21,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:21,807 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-14 13:39:21,808 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-14 13:39:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:21,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-14 13:39:21,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:21,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:21,962 INFO L388 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-14 13:39:21,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:21,967 INFO L388 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-14 13:39:21,985 INFO L354 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-14 13:39:21,985 INFO L388 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-14 13:39:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:21,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:21,992 INFO L388 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-14 13:39:22,021 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-12-14 13:39:22,021 INFO L388 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-14 13:39:22,033 INFO L388 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-14 13:39:22,038 INFO L388 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-14 13:39:22,042 INFO L388 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-14 13:39:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:22,116 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-14 13:39:22,117 INFO L388 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 67 [2021-12-14 13:39:22,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:22,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:22,123 INFO L388 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 25 treesize of output 30 [2021-12-14 13:39:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:22,140 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-14 13:39:22,141 INFO L388 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-14 13:39:22,145 INFO L388 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 22 treesize of output 24 [2021-12-14 13:39:22,218 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-14 13:39:22,218 INFO L388 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 81 treesize of output 65 [2021-12-14 13:39:22,222 INFO L388 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-14 13:39:22,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:22,227 INFO L388 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 25 treesize of output 30 [2021-12-14 13:39:22,527 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 13:39:22,528 INFO L388 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 105 treesize of output 55 [2021-12-14 13:39:22,546 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 13:39:22,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-14 13:39:22,572 INFO L388 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-14 13:39:22,589 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-14 13:39:22,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:39:22,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1638 (Array Int Int))) (= 2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1638)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1637))) (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)) (+ 8 (select (select .cse3 .cse1) .cse2))))))) is different from false [2021-12-14 13:39:22,703 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:39:22,703 INFO L388 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-14 13:39:22,808 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-14 13:39:22,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811031859] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:39:22,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:39:22,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2021-12-14 13:39:22,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436280163] [2021-12-14 13:39:22,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:39:22,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-14 13:39:22,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:22,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-14 13:39:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2021-12-14 13:39:22,810 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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-14 13:39:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:23,619 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2021-12-14 13:39:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:39:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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) Word has length 21 [2021-12-14 13:39:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:23,621 INFO L225 Difference]: With dead ends: 177 [2021-12-14 13:39:23,621 INFO L226 Difference]: Without dead ends: 142 [2021-12-14 13:39:23,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=591, Unknown=1, NotChecked=50, Total=756 [2021-12-14 13:39:23,622 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 161 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:23,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 304 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 453 Invalid, 0 Unknown, 127 Unchecked, 0.6s Time] [2021-12-14 13:39:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-14 13:39:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2021-12-14 13:39:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 110 states have internal predecessors, (136), 0 states have call successors, (0), 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-14 13:39:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2021-12-14 13:39:23,630 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 21 [2021-12-14 13:39:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:23,630 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2021-12-14 13:39:23,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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-14 13:39:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2021-12-14 13:39:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:39:23,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:23,631 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-14 13:39:23,648 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-14 13:39:23,835 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-14 13:39:23,835 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-14 13:39:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2021-12-14 13:39:23,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:23,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248479043] [2021-12-14 13:39:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:23,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:24,079 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-14 13:39:24,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:24,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248479043] [2021-12-14 13:39:24,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248479043] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:24,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190040138] [2021-12-14 13:39:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:24,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:24,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:24,080 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:39:24,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 13:39:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:24,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-14 13:39:24,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:24,246 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-14 13:39:24,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 23 [2021-12-14 13:39:24,298 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-14 13:39:24,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 13:39:24,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 13:39:24,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 13:39:24,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 13:39:24,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:24,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2021-12-14 13:39:24,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 13:39:24,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:24,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2021-12-14 13:39:24,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2021-12-14 13:39:24,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:24,606 INFO L388 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2021-12-14 13:39:24,610 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-14 13:39:24,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:39:24,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 178 [2021-12-14 13:39:24,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 318 [2021-12-14 13:39:42,501 INFO L354 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2021-12-14 13:39:42,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 104 [2021-12-14 13:39:42,506 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:39:42,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 96 [2021-12-14 13:39:42,515 INFO L354 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2021-12-14 13:39:42,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 105 [2021-12-14 13:39:42,589 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-14 13:39:42,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190040138] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:39:42,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:39:42,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 26 [2021-12-14 13:39:42,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089126682] [2021-12-14 13:39:42,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:39:42,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 13:39:42,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:42,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 13:39:42,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=555, Unknown=7, NotChecked=0, Total=650 [2021-12-14 13:39:42,591 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:39:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:43,017 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2021-12-14 13:39:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:39:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 13:39:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:43,018 INFO L225 Difference]: With dead ends: 142 [2021-12-14 13:39:43,018 INFO L226 Difference]: Without dead ends: 140 [2021-12-14 13:39:43,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=112, Invalid=637, Unknown=7, NotChecked=0, Total=756 [2021-12-14 13:39:43,019 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 71 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:43,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 337 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 299 Invalid, 0 Unknown, 115 Unchecked, 0.4s Time] [2021-12-14 13:39:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-14 13:39:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2021-12-14 13:39:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.25) internal successors, (150), 121 states have internal predecessors, (150), 0 states have call successors, (0), 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-14 13:39:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 150 transitions. [2021-12-14 13:39:43,025 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 150 transitions. Word has length 24 [2021-12-14 13:39:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:43,025 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 150 transitions. [2021-12-14 13:39:43,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:39:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2021-12-14 13:39:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:39:43,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:43,026 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:43,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 13:39:43,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 13:39:43,242 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-14 13:39:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2021-12-14 13:39:43,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:43,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147564540] [2021-12-14 13:39:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:43,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:39:43,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:43,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147564540] [2021-12-14 13:39:43,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147564540] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:43,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917365851] [2021-12-14 13:39:43,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:39:43,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:43,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:43,395 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:39:43,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 13:39:44,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 13:39:44,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:39:44,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-14 13:39:44,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:44,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,580 INFO L388 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-14 13:39:44,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,586 INFO L388 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-14 13:39:44,603 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-14 13:39:44,604 INFO L388 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 87 treesize of output 86 [2021-12-14 13:39:44,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,610 INFO L388 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 33 treesize of output 37 [2021-12-14 13:39:44,615 INFO L388 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-14 13:39:44,620 INFO L388 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 19 treesize of output 31 [2021-12-14 13:39:44,624 INFO L388 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-14 13:39:44,628 INFO L388 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 19 treesize of output 31 [2021-12-14 13:39:44,635 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-14 13:39:44,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2021-12-14 13:39:44,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2021-12-14 13:39:44,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,750 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-14 13:39:44,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 65 [2021-12-14 13:39:44,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:44,865 INFO L354 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-12-14 13:39:44,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 75 [2021-12-14 13:39:44,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:44,874 INFO L354 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2021-12-14 13:39:44,874 INFO L388 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 1 case distinctions, treesize of input 54 treesize of output 55 [2021-12-14 13:39:45,038 INFO L354 Elim1Store]: treesize reduction 199, result has 15.3 percent of original size [2021-12-14 13:39:45,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 120 treesize of output 93 [2021-12-14 13:39:45,072 INFO L354 Elim1Store]: treesize reduction 208, result has 15.1 percent of original size [2021-12-14 13:39:45,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 126 [2021-12-14 13:39:45,189 INFO L354 Elim1Store]: treesize reduction 97, result has 10.2 percent of original size [2021-12-14 13:39:45,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 139 treesize of output 77 [2021-12-14 13:39:45,198 INFO L354 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2021-12-14 13:39:45,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2021-12-14 13:39:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:39:45,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:39:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:39:50,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917365851] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:39:50,948 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:39:50,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2021-12-14 13:39:50,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062014299] [2021-12-14 13:39:50,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:39:50,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 13:39:50,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:50,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 13:39:50,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=250, Unknown=2, NotChecked=0, Total=306 [2021-12-14 13:39:50,950 INFO L87 Difference]: Start difference. First operand 122 states and 150 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:39:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:51,177 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2021-12-14 13:39:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:39:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-14 13:39:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:51,178 INFO L225 Difference]: With dead ends: 137 [2021-12-14 13:39:51,178 INFO L226 Difference]: Without dead ends: 109 [2021-12-14 13:39:51,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=64, Invalid=276, Unknown=2, NotChecked=0, Total=342 [2021-12-14 13:39:51,178 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:51,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 302 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2021-12-14 13:39:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-14 13:39:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-14 13:39:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.2710280373831775) internal successors, (136), 108 states have internal predecessors, (136), 0 states have call successors, (0), 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-14 13:39:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 136 transitions. [2021-12-14 13:39:51,183 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 136 transitions. Word has length 25 [2021-12-14 13:39:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:51,183 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 136 transitions. [2021-12-14 13:39:51,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:39:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2021-12-14 13:39:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:39:51,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:51,184 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:51,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:39:51,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 13:39:51,396 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-14 13:39:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash 352741712, now seen corresponding path program 1 times [2021-12-14 13:39:51,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:51,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016496359] [2021-12-14 13:39:51,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:51,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:39:51,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:51,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016496359] [2021-12-14 13:39:51,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016496359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:39:51,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:39:51,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:39:51,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115546333] [2021-12-14 13:39:51,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:39:51,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:39:51,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:39:51,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:39:51,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:39:51,489 INFO L87 Difference]: Start difference. First operand 109 states and 136 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 13:39:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:39:51,739 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2021-12-14 13:39:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:39:51,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-14 13:39:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:39:51,740 INFO L225 Difference]: With dead ends: 180 [2021-12-14 13:39:51,740 INFO L226 Difference]: Without dead ends: 113 [2021-12-14 13:39:51,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:39:51,741 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 49 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:39:51,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 171 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:39:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-14 13:39:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2021-12-14 13:39:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 102 states have internal predecessors, (126), 0 states have call successors, (0), 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-14 13:39:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2021-12-14 13:39:51,745 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 25 [2021-12-14 13:39:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:39:51,745 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2021-12-14 13:39:51,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 13:39:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2021-12-14 13:39:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:39:51,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:39:51,746 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:39:51,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 13:39:51,746 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-14 13:39:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:39:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2021-12-14 13:39:51,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:39:51,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118242830] [2021-12-14 13:39:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:51,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:39:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:39:52,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:39:52,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118242830] [2021-12-14 13:39:52,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118242830] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:39:52,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304333768] [2021-12-14 13:39:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:39:52,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:39:52,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:39:52,073 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:39:52,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 13:39:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:39:52,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-14 13:39:52,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:39:52,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,252 INFO L388 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-14 13:39:52,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,257 INFO L388 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-14 13:39:52,272 INFO L354 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2021-12-14 13:39:52,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2021-12-14 13:39:52,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-14 13:39:52,284 INFO L388 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-14 13:39:52,291 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-14 13:39:52,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2021-12-14 13:39:52,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,354 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 13:39:52,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-14 13:39:52,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:52,390 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-12-14 13:39:52,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 67 [2021-12-14 13:39:52,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:52,591 INFO L354 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2021-12-14 13:39:52,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 82 [2021-12-14 13:39:52,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:52,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:39:52,608 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-14 13:39:52,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 44 [2021-12-14 13:39:59,921 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-12-14 13:39:59,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 95 [2021-12-14 13:39:59,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:39:59,933 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 13:39:59,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 45 [2021-12-14 13:39:59,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-14 13:40:00,148 INFO L388 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 22 treesize of output 10 [2021-12-14 13:40:00,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:40:00,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2021-12-14 13:40:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:40:00,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:40:00,231 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2375 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2375) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2376 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2376) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2021-12-14 13:40:02,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2373 Int) (v_ArrVal_2374 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2374)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2375 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2375)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2376 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2374)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2376) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) is different from false [2021-12-14 13:40:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 13:40:02,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304333768] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:40:02,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:40:02,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2021-12-14 13:40:02,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323041788] [2021-12-14 13:40:02,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:40:02,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-14 13:40:02,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:40:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-14 13:40:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=502, Unknown=11, NotChecked=94, Total=702 [2021-12-14 13:40:02,728 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 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-14 13:40:02,996 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse4 (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| .cse5)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse1 (= (select .cse9 .cse11) 0)) (.cse6 (= (select .cse10 .cse11) 0)) (.cse7 (select .cse2 0)) (.cse8 (not .cse4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0) 0) (= (select .cse2 4) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2373 Int) (v_ArrVal_2374 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2374)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2375 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2375)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2376 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2374)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2376) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| |c_ULTIMATE.start_main_~item~0#1.offset|) (or .cse4 (and .cse1 (not (= .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|)) .cse6)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| .cse7)) .cse6 (not (= .cse5 .cse7)) .cse8 (or (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) .cse8) (= (select .cse9 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0)))))) is different from false [2021-12-14 13:40:05,001 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse4 (select .cse2 0)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (and (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select .cse0 .cse1) 0) (= (select .cse2 4) 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2373 Int) (v_ArrVal_2374 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2374)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2375 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2375)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2376 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2374)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 4 v_ArrVal_2373)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2376) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| .cse4)) (= (select .cse5 .cse1) 0) (not (= .cse6 .cse4)) (= (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))))) is different from false [2021-12-14 13:40:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:40:07,746 INFO L93 Difference]: Finished difference Result 178 states and 217 transitions. [2021-12-14 13:40:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-14 13:40:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 13:40:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:40:07,752 INFO L225 Difference]: With dead ends: 178 [2021-12-14 13:40:07,752 INFO L226 Difference]: Without dead ends: 167 [2021-12-14 13:40:07,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=200, Invalid=993, Unknown=13, NotChecked=276, Total=1482 [2021-12-14 13:40:07,753 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 132 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:40:07,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 552 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 241 Invalid, 0 Unknown, 509 Unchecked, 0.2s Time] [2021-12-14 13:40:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-14 13:40:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 131. [2021-12-14 13:40:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 130 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:40:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 163 transitions. [2021-12-14 13:40:07,764 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 163 transitions. Word has length 27 [2021-12-14 13:40:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:40:07,764 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 163 transitions. [2021-12-14 13:40:07,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 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-14 13:40:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2021-12-14 13:40:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:40:07,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:40:07,765 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:40:07,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 13:40:07,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 13:40:07,983 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-12-14 13:40:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:40:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1921519731, now seen corresponding path program 1 times [2021-12-14 13:40:07,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:40:07,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478729924] [2021-12-14 13:40:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:40:07,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:40:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:40:08,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:40:08,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478729924] [2021-12-14 13:40:08,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478729924] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:40:08,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34332193] [2021-12-14 13:40:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:40:08,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:40:08,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:40:08,128 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:40:08,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 13:40:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:08,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-14 13:40:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:40:08,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,331 INFO L388 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-14 13:40:08,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,335 INFO L388 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-14 13:40:08,350 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-14 13:40:08,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2021-12-14 13:40:08,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,355 INFO L388 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-14 13:40:08,359 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:40:08,359 INFO L388 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-14 13:40:08,363 INFO L388 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-14 13:40:08,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,425 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-14 13:40:08,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2021-12-14 13:40:08,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,435 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-14 13:40:08,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2021-12-14 13:40:08,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:40:08,538 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-14 13:40:08,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2021-12-14 13:40:08,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:08,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:40:08,558 INFO L354 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2021-12-14 13:40:08,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 68 [2021-12-14 13:40:12,884 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 13:40:12,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 81 [2021-12-14 13:40:12,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:12,912 INFO L354 Elim1Store]: treesize reduction 14, result has 65.0 percent of original size [2021-12-14 13:40:12,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 75 [2021-12-14 13:40:13,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-14 13:40:13,069 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:40:13,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 13:40:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:40:13,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:40:13,100 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2596 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2596) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2595 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2595) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) is different from false [2021-12-14 13:40:13,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2593 Int) (v_ArrVal_2594 Int)) (or (and (forall ((v_ArrVal_2596 (Array Int Int))) (= (select (select (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2593)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2594)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2596)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0)) (forall ((v_ArrVal_2595 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_2594)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2595)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) 0))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2 v_ArrVal_2593)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse2 v_ArrVal_2594)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))))) is different from false