./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --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 19:46:27,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:46:27,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:46:27,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:46:27,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:46:27,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:46:27,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:46:27,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:46:27,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:46:27,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:46:27,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:46:27,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:46:27,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:46:27,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:46:27,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:46:27,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:46:27,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:46:27,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:46:27,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:46:27,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:46:27,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:46:27,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:46:27,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:46:27,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:46:27,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:46:27,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:46:27,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:46:27,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:46:27,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:46:27,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:46:27,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:46:27,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:46:27,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:46:27,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:46:27,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:46:27,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:46:27,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:46:27,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:46:27,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:46:27,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:46:27,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:46:27,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:46:27,797 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:46:27,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:46:27,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:46:27,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:46:27,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:46:27,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:46:27,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:46:27,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:46:27,802 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:46:27,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:46:27,803 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:46:27,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:46:27,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:46:27,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:46:27,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:46:27,804 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:46:27,804 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:46:27,804 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:46:27,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:46:27,804 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:46:27,805 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:46:27,805 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:46:27,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:46:27,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:46:27,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:46:27,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:46:27,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:46:27,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:46:27,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:46:27,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:46:27,807 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:46:27,807 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 19:46:28,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:46:28,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:46:28,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:46:28,059 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:46:28,059 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:46:28,060 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 19:46:28,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d284d01/3a195e04ce9140a990ad8aaa824fa31b/FLAG83c5f7a5a [2021-12-14 19:46:28,561 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:46:28,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-14 19:46:28,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d284d01/3a195e04ce9140a990ad8aaa824fa31b/FLAG83c5f7a5a [2021-12-14 19:46:29,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d284d01/3a195e04ce9140a990ad8aaa824fa31b [2021-12-14 19:46:29,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:46:29,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:46:29,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:46:29,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:46:29,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:46:29,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbc9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29, skipping insertion in model container [2021-12-14 19:46:29,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:46:29,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:46:29,386 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 19:46:29,393 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 19:46:29,397 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 19:46:29,404 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 19:46:29,406 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 19:46:29,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:46:29,419 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:46:29,452 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 19:46:29,453 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 19:46:29,454 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 19:46:29,457 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 19:46:29,458 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 19:46:29,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:46:29,482 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:46:29,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29 WrapperNode [2021-12-14 19:46:29,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:46:29,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:46:29,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:46:29,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:46:29,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,523 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2021-12-14 19:46:29,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:46:29,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:46:29,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:46:29,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:46:29,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:46:29,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:46:29,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:46:29,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:46:29,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (1/1) ... [2021-12-14 19:46:29,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:46:29,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:29,608 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 19:46:29,623 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 19:46:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:46:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:46:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:46:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:46:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:46:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:46:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:46:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:46:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:46:29,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:46:29,756 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:46:29,758 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:46:30,082 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:46:30,088 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:46:30,093 INFO L301 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-14 19:46:30,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:30 BoogieIcfgContainer [2021-12-14 19:46:30,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:46:30,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:46:30,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:46:30,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:46:30,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:46:29" (1/3) ... [2021-12-14 19:46:30,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565ee70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:30, skipping insertion in model container [2021-12-14 19:46:30,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:29" (2/3) ... [2021-12-14 19:46:30,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565ee70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:30, skipping insertion in model container [2021-12-14 19:46:30,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:30" (3/3) ... [2021-12-14 19:46:30,104 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2021-12-14 19:46:30,112 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:46:30,112 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-12-14 19:46:30,151 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:46:30,156 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 19:46:30,157 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-12-14 19:46:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 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 19:46:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:46:30,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:30,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:46:30,183 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:46:30,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:30,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656455135] [2021-12-14 19:46:30,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:30,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:30,363 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 19:46:30,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:30,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656455135] [2021-12-14 19:46:30,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656455135] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:30,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:30,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:30,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740332690] [2021-12-14 19:46:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:30,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:30,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:30,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:30,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:30,406 INFO L87 Difference]: Start difference. First operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 19:46:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:30,590 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2021-12-14 19:46:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:30,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-14 19:46:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:30,606 INFO L225 Difference]: With dead ends: 190 [2021-12-14 19:46:30,606 INFO L226 Difference]: Without dead ends: 186 [2021-12-14 19:46:30,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:46:30,613 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:30,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 120 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:30,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-14 19:46:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2021-12-14 19:46:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.9259259259259258) internal successors, (156), 148 states have internal predecessors, (156), 0 states have call successors, (0), 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 19:46:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2021-12-14 19:46:30,670 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2021-12-14 19:46:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:30,670 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2021-12-14 19:46:30,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 19:46:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2021-12-14 19:46:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:46:30,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:30,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:46:30,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:46:30,682 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:30,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:46:30,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:30,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105966590] [2021-12-14 19:46:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:30,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:30,749 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 19:46:30,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:30,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105966590] [2021-12-14 19:46:30,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105966590] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:30,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:30,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:30,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819718986] [2021-12-14 19:46:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:30,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:30,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:30,753 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 19:46:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:30,861 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2021-12-14 19:46:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:30,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-14 19:46:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:30,863 INFO L225 Difference]: With dead ends: 185 [2021-12-14 19:46:30,863 INFO L226 Difference]: Without dead ends: 185 [2021-12-14 19:46:30,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:46:30,864 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:30,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 190 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-14 19:46:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2021-12-14 19:46:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 81 states have (on average 1.876543209876543) internal successors, (152), 144 states have internal predecessors, (152), 0 states have call successors, (0), 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 19:46:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2021-12-14 19:46:30,872 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 3 [2021-12-14 19:46:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:30,873 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2021-12-14 19:46:30,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 19:46:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2021-12-14 19:46:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:46:30,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:30,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:30,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:46:30,874 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2021-12-14 19:46:30,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:30,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129582735] [2021-12-14 19:46:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:30,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:30,940 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 19:46:30,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:30,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129582735] [2021-12-14 19:46:30,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129582735] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:30,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:30,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:30,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611057756] [2021-12-14 19:46:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:30,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:30,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:30,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:30,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:30,943 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:31,184 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2021-12-14 19:46:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:31,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:31,187 INFO L225 Difference]: With dead ends: 151 [2021-12-14 19:46:31,187 INFO L226 Difference]: Without dead ends: 151 [2021-12-14 19:46:31,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:46:31,192 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 97 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:31,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 305 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-14 19:46:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2021-12-14 19:46:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 142 states have internal predecessors, (158), 0 states have call successors, (0), 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 19:46:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2021-12-14 19:46:31,204 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 10 [2021-12-14 19:46:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:31,205 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2021-12-14 19:46:31,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2021-12-14 19:46:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:46:31,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:31,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:31,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:46:31,206 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:31,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2021-12-14 19:46:31,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:31,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357990784] [2021-12-14 19:46:31,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:31,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:31,315 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 19:46:31,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:31,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357990784] [2021-12-14 19:46:31,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357990784] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:31,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:31,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:31,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110289505] [2021-12-14 19:46:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:31,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:31,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:31,317 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:31,523 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2021-12-14 19:46:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:31,524 INFO L225 Difference]: With dead ends: 139 [2021-12-14 19:46:31,524 INFO L226 Difference]: Without dead ends: 139 [2021-12-14 19:46:31,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:46:31,526 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:31,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 416 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-14 19:46:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-12-14 19:46:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.711111111111111) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2021-12-14 19:46:31,537 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 10 [2021-12-14 19:46:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:31,540 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2021-12-14 19:46:31,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2021-12-14 19:46:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:46:31,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:31,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:31,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:46:31,541 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2021-12-14 19:46:31,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:31,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939823369] [2021-12-14 19:46:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:31,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:31,622 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 19:46:31,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:31,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939823369] [2021-12-14 19:46:31,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939823369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:31,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:31,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:31,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053282682] [2021-12-14 19:46:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:31,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:31,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:31,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:31,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:31,625 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 19:46:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:31,810 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2021-12-14 19:46:31,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:46:31,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 17 [2021-12-14 19:46:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:31,811 INFO L225 Difference]: With dead ends: 146 [2021-12-14 19:46:31,811 INFO L226 Difference]: Without dead ends: 146 [2021-12-14 19:46:31,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:46:31,812 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:31,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 297 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-14 19:46:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2021-12-14 19:46:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.7) internal successors, (153), 137 states have internal predecessors, (153), 0 states have call successors, (0), 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 19:46:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2021-12-14 19:46:31,818 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 17 [2021-12-14 19:46:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:31,818 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2021-12-14 19:46:31,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 19:46:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2021-12-14 19:46:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:46:31,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:31,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:31,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:46:31,819 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2021-12-14 19:46:31,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:31,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126610995] [2021-12-14 19:46:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:31,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:31,903 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 19:46:31,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126610995] [2021-12-14 19:46:31,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126610995] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:31,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:31,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:31,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763301058] [2021-12-14 19:46:31,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:31,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:31,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:31,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:31,906 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 19:46:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:32,080 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2021-12-14 19:46:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:46:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 17 [2021-12-14 19:46:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:32,081 INFO L225 Difference]: With dead ends: 138 [2021-12-14 19:46:32,081 INFO L226 Difference]: Without dead ends: 138 [2021-12-14 19:46:32,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:46:32,082 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:32,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-14 19:46:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2021-12-14 19:46:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.6666666666666667) internal successors, (150), 134 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 19:46:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2021-12-14 19:46:32,086 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 17 [2021-12-14 19:46:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:32,087 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2021-12-14 19:46:32,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 19:46:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2021-12-14 19:46:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:46:32,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:32,087 INFO L514 BasicCegarLoop]: trace histogram [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 19:46:32,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:46:32,088 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:32,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 840457529, now seen corresponding path program 1 times [2021-12-14 19:46:32,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:32,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298031067] [2021-12-14 19:46:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:32,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:32,136 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 19:46:32,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:32,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298031067] [2021-12-14 19:46:32,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298031067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:32,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:32,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:32,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623393408] [2021-12-14 19:46:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:32,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:32,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:32,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:32,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:32,138 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:32,205 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2021-12-14 19:46:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 19:46:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:32,207 INFO L225 Difference]: With dead ends: 141 [2021-12-14 19:46:32,207 INFO L226 Difference]: Without dead ends: 141 [2021-12-14 19:46:32,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:46:32,209 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:32,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-14 19:46:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2021-12-14 19:46:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 129 states have internal predecessors, (145), 0 states have call successors, (0), 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 19:46:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2021-12-14 19:46:32,214 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 23 [2021-12-14 19:46:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:32,214 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2021-12-14 19:46:32,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2021-12-14 19:46:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:46:32,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:32,216 INFO L514 BasicCegarLoop]: trace histogram [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 19:46:32,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:46:32,216 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash 840457530, now seen corresponding path program 1 times [2021-12-14 19:46:32,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:32,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389993762] [2021-12-14 19:46:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:32,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:32,310 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 19:46:32,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:32,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389993762] [2021-12-14 19:46:32,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389993762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:32,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:32,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:32,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529637446] [2021-12-14 19:46:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:32,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:32,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:32,315 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:32,379 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2021-12-14 19:46:32,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 19:46:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:32,381 INFO L225 Difference]: With dead ends: 136 [2021-12-14 19:46:32,381 INFO L226 Difference]: Without dead ends: 136 [2021-12-14 19:46:32,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:46:32,382 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:32,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 144 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-14 19:46:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2021-12-14 19:46:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 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 19:46:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2021-12-14 19:46:32,385 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2021-12-14 19:46:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:32,385 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2021-12-14 19:46:32,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2021-12-14 19:46:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:46:32,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:32,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:32,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:46:32,387 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:32,387 INFO L85 PathProgramCache]: Analyzing trace with hash 225913191, now seen corresponding path program 1 times [2021-12-14 19:46:32,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:32,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374460012] [2021-12-14 19:46:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:32,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:32,483 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 19:46:32,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:32,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374460012] [2021-12-14 19:46:32,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374460012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:32,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:32,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:46:32,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335943906] [2021-12-14 19:46:32,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:32,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:32,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:32,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:32,486 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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 19:46:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:32,597 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2021-12-14 19:46:32,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:46:32,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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 19:46:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:32,599 INFO L225 Difference]: With dead ends: 175 [2021-12-14 19:46:32,599 INFO L226 Difference]: Without dead ends: 175 [2021-12-14 19:46:32,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:32,600 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 214 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:32,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 109 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-14 19:46:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2021-12-14 19:46:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 131 states have internal predecessors, (152), 0 states have call successors, (0), 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 19:46:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2021-12-14 19:46:32,603 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 25 [2021-12-14 19:46:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:32,604 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2021-12-14 19:46:32,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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 19:46:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2021-12-14 19:46:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:46:32,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:32,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:32,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:46:32,605 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash 225913192, now seen corresponding path program 1 times [2021-12-14 19:46:32,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:32,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315412386] [2021-12-14 19:46:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:32,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:32,729 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 19:46:32,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:32,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315412386] [2021-12-14 19:46:32,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315412386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:32,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:32,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:46:32,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232458297] [2021-12-14 19:46:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:32,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:46:32,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:46:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:46:32,732 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) 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 19:46:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:33,015 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2021-12-14 19:46:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) 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 19:46:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:33,018 INFO L225 Difference]: With dead ends: 226 [2021-12-14 19:46:33,018 INFO L226 Difference]: Without dead ends: 226 [2021-12-14 19:46:33,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:46:33,019 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 366 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:33,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 241 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-14 19:46:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 170. [2021-12-14 19:46:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 135 states have (on average 1.548148148148148) internal successors, (209), 169 states have internal predecessors, (209), 0 states have call successors, (0), 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 19:46:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2021-12-14 19:46:33,026 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 25 [2021-12-14 19:46:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:33,027 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2021-12-14 19:46:33,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) 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 19:46:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2021-12-14 19:46:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:46:33,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:33,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:33,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:46:33,029 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1586624732, now seen corresponding path program 1 times [2021-12-14 19:46:33,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:33,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515676591] [2021-12-14 19:46:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:33,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:33,083 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 19:46:33,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:33,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515676591] [2021-12-14 19:46:33,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515676591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:33,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:33,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:46:33,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328193395] [2021-12-14 19:46:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:33,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:33,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:33,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:33,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:33,086 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:33,174 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2021-12-14 19:46:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:46:33,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 19:46:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:33,176 INFO L225 Difference]: With dead ends: 210 [2021-12-14 19:46:33,176 INFO L226 Difference]: Without dead ends: 210 [2021-12-14 19:46:33,177 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 19:46:33,177 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 188 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:33,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 217 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-14 19:46:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2021-12-14 19:46:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 167 states have internal predecessors, (205), 0 states have call successors, (0), 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 19:46:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2021-12-14 19:46:33,183 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 26 [2021-12-14 19:46:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:33,183 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2021-12-14 19:46:33,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2021-12-14 19:46:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:46:33,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:33,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:33,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:46:33,185 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1044883735, now seen corresponding path program 1 times [2021-12-14 19:46:33,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:33,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092222699] [2021-12-14 19:46:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:33,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:33,546 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 19:46:33,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:33,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092222699] [2021-12-14 19:46:33,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092222699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:33,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:33,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-14 19:46:33,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003633868] [2021-12-14 19:46:33,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:33,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 19:46:33,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 19:46:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:46:33,549 INFO L87 Difference]: Start difference. First operand 168 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:34,257 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2021-12-14 19:46:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:46:34,258 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-14 19:46:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:34,259 INFO L225 Difference]: With dead ends: 198 [2021-12-14 19:46:34,259 INFO L226 Difference]: Without dead ends: 198 [2021-12-14 19:46:34,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 19:46:34,260 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 205 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:34,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 629 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:46:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-14 19:46:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2021-12-14 19:46:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.4822695035460993) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 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 19:46:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2021-12-14 19:46:34,264 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 29 [2021-12-14 19:46:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:34,264 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2021-12-14 19:46:34,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2021-12-14 19:46:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:46:34,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:34,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:34,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:46:34,265 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash 981328753, now seen corresponding path program 1 times [2021-12-14 19:46:34,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:34,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894662002] [2021-12-14 19:46:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:34,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:34,313 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 19:46:34,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:34,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894662002] [2021-12-14 19:46:34,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894662002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:34,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:34,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:46:34,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866467148] [2021-12-14 19:46:34,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:34,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:34,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:34,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:34,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:34,316 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 19:46:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:34,336 INFO L93 Difference]: Finished difference Result 172 states and 207 transitions. [2021-12-14 19:46:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-12-14 19:46:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:34,337 INFO L225 Difference]: With dead ends: 172 [2021-12-14 19:46:34,337 INFO L226 Difference]: Without dead ends: 172 [2021-12-14 19:46:34,338 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 19:46:34,338 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:34,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:46:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-14 19:46:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-12-14 19:46:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 171 states have internal predecessors, (207), 0 states have call successors, (0), 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 19:46:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2021-12-14 19:46:34,343 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 31 [2021-12-14 19:46:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:34,343 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2021-12-14 19:46:34,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 19:46:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2021-12-14 19:46:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:46:34,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:34,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:34,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:46:34,345 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash 873646240, now seen corresponding path program 1 times [2021-12-14 19:46:34,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:34,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366177923] [2021-12-14 19:46:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:34,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:34,398 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 19:46:34,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:34,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366177923] [2021-12-14 19:46:34,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366177923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:34,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:34,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:46:34,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374526877] [2021-12-14 19:46:34,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:34,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:34,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:34,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:34,401 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:34,489 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2021-12-14 19:46:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:46:34,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-14 19:46:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:34,491 INFO L225 Difference]: With dead ends: 209 [2021-12-14 19:46:34,491 INFO L226 Difference]: Without dead ends: 209 [2021-12-14 19:46:34,491 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 19:46:34,491 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:34,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 216 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-14 19:46:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2021-12-14 19:46:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.471830985915493) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 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 19:46:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2021-12-14 19:46:34,496 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 35 [2021-12-14 19:46:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:34,496 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2021-12-14 19:46:34,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2021-12-14 19:46:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:46:34,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:34,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:34,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:46:34,498 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash 124937643, now seen corresponding path program 1 times [2021-12-14 19:46:34,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662171183] [2021-12-14 19:46:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:34,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:34,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:34,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662171183] [2021-12-14 19:46:34,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662171183] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:34,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827935045] [2021-12-14 19:46:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:34,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:34,903 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 19:46:34,907 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 19:46:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:35,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-14 19:46:35,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:35,154 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:35,181 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:35,182 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 11 treesize of output 11 [2021-12-14 19:46:35,244 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 11 treesize of output 7 [2021-12-14 19:46:35,295 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 14 treesize of output 16 [2021-12-14 19:46:35,308 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 14 treesize of output 16 [2021-12-14 19:46:35,337 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:46:35,338 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 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:46:35,386 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 19 treesize of output 18 [2021-12-14 19:46:35,580 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:46:35,580 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 47 treesize of output 49 [2021-12-14 19:46:35,605 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 12 treesize of output 8 [2021-12-14 19:46:35,708 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:46:35,709 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 56 treesize of output 56 [2021-12-14 19:46:35,721 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-14 19:46:35,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:46:35,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-12-14 19:46:35,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033135064] [2021-12-14 19:46:35,722 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 19:46:35,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 19:46:35,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 19:46:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-12-14 19:46:35,724 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:46:35,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-12-14 19:46:35,727 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:35,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:46:35,754 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 19:46:35,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 19:46:35,944 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@58c5c70d at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 19:46:35,948 INFO L158 Benchmark]: Toolchain (without parser) took 6856.69ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 60.3MB in the beginning and 54.6MB in the end (delta: 5.7MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2021-12-14 19:46:35,948 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.8MB in the beginning and 48.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:46:35,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.41ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 60.3MB in the beginning and 79.8MB in the end (delta: -19.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:46:35,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.01ms. Allocated memory is still 111.1MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:46:35,948 INFO L158 Benchmark]: Boogie Preprocessor took 49.55ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:46:35,949 INFO L158 Benchmark]: RCFGBuilder took 521.60ms. Allocated memory is still 111.1MB. Free memory was 75.6MB in the beginning and 80.4MB in the end (delta: -4.8MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2021-12-14 19:46:35,949 INFO L158 Benchmark]: TraceAbstraction took 5849.50ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.9MB in the beginning and 54.6MB in the end (delta: 25.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2021-12-14 19:46:35,950 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.8MB in the beginning and 48.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.41ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 60.3MB in the beginning and 79.8MB in the end (delta: -19.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.01ms. Allocated memory is still 111.1MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.55ms. Allocated memory is still 111.1MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.60ms. Allocated memory is still 111.1MB. Free memory was 75.6MB in the beginning and 80.4MB in the end (delta: -4.8MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5849.50ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.9MB in the beginning and 54.6MB in the end (delta: 25.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@58c5c70d de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@58c5c70d: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-14 19:46:35,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --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 19:46:37,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:46:37,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:46:38,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:46:38,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:46:38,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:46:38,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:46:38,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:46:38,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:46:38,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:46:38,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:46:38,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:46:38,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:46:38,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:46:38,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:46:38,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:46:38,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:46:38,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:46:38,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:46:38,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:46:38,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:46:38,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:46:38,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:46:38,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:46:38,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:46:38,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:46:38,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:46:38,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:46:38,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:46:38,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:46:38,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:46:38,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:46:38,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:46:38,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:46:38,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:46:38,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:46:38,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:46:38,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:46:38,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:46:38,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:46:38,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:46:38,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:46:38,102 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:46:38,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:46:38,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:46:38,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:46:38,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:46:38,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:46:38,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:46:38,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:46:38,107 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:46:38,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:46:38,108 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:46:38,108 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:46:38,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:46:38,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:46:38,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:46:38,109 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:46:38,109 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:46:38,109 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:46:38,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:46:38,110 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:46:38,110 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:46:38,110 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:46:38,110 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:46:38,111 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:46:38,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:46:38,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:46:38,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:46:38,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:46:38,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:46:38,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:46:38,112 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:46:38,112 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:46:38,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:46:38,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:46:38,113 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 19:46:38,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:46:38,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:46:38,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:46:38,495 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:46:38,496 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:46:38,497 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 19:46:38,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67028886e/48128648e66749008ec3f2d3358a5358/FLAGfb509ca47 [2021-12-14 19:46:39,068 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:46:39,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2021-12-14 19:46:39,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67028886e/48128648e66749008ec3f2d3358a5358/FLAGfb509ca47 [2021-12-14 19:46:39,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67028886e/48128648e66749008ec3f2d3358a5358 [2021-12-14 19:46:39,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:46:39,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:46:39,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:46:39,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:46:39,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:46:39,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:39,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f7a9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39, skipping insertion in model container [2021-12-14 19:46:39,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:39,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:46:39,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:46:39,854 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 19:46:39,858 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 19:46:39,868 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 19:46:39,875 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 19:46:39,877 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 19:46:39,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:46:39,900 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:46:39,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2021-12-14 19:46:39,947 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 19:46:39,948 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 19:46:39,951 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 19:46:39,953 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 19:46:39,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:46:39,988 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:46:39,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39 WrapperNode [2021-12-14 19:46:39,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:46:39,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:46:39,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:46:39,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:46:39,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,063 INFO L137 Inliner]: procedures = 122, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 159 [2021-12-14 19:46:40,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:46:40,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:46:40,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:46:40,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:46:40,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:46:40,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:46:40,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:46:40,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:46:40,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (1/1) ... [2021-12-14 19:46:40,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:46:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:40,164 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 19:46:40,165 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 19:46:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:46:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:46:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:46:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:46:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:46:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:46:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:46:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:46:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:46:40,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:46:40,347 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:46:40,349 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:46:40,999 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:46:41,008 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:46:41,008 INFO L301 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-14 19:46:41,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:41 BoogieIcfgContainer [2021-12-14 19:46:41,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:46:41,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:46:41,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:46:41,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:46:41,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:46:39" (1/3) ... [2021-12-14 19:46:41,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fd006a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:41, skipping insertion in model container [2021-12-14 19:46:41,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:39" (2/3) ... [2021-12-14 19:46:41,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fd006a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:41, skipping insertion in model container [2021-12-14 19:46:41,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:41" (3/3) ... [2021-12-14 19:46:41,016 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2021-12-14 19:46:41,020 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:46:41,021 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-12-14 19:46:41,059 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:46:41,065 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 19:46:41,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-12-14 19:46:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.25) internal successors, (180), 152 states have internal predecessors, (180), 0 states have call successors, (0), 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 19:46:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:46:41,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:41,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:46:41,097 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:41,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:46:41,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:41,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34984244] [2021-12-14 19:46:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:41,112 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:41,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:41,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:41,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 19:46:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:41,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:46:41,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:41,261 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:41,281 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 19:46:41,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:41,285 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:41,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34984244] [2021-12-14 19:46:41,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34984244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:41,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:41,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:41,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493176560] [2021-12-14 19:46:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:41,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:41,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:41,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:41,322 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.25) internal successors, (180), 152 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 19:46:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:41,641 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2021-12-14 19:46:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:41,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-14 19:46:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:41,652 INFO L225 Difference]: With dead ends: 188 [2021-12-14 19:46:41,653 INFO L226 Difference]: Without dead ends: 184 [2021-12-14 19:46:41,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:46:41,660 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 139 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:41,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 118 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:46:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-14 19:46:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2021-12-14 19:46:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 79 states have (on average 1.9493670886075949) internal successors, (154), 146 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2021-12-14 19:46:41,716 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 3 [2021-12-14 19:46:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:41,716 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2021-12-14 19:46:41,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 19:46:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2021-12-14 19:46:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:46:41,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:41,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:46:41,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:41,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:41,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:41,929 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:46:41,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:41,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008338719] [2021-12-14 19:46:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:41,931 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:41,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:41,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:41,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 19:46:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:41,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:46:41,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:42,010 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:42,020 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 19:46:42,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:42,021 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:42,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008338719] [2021-12-14 19:46:42,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008338719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:42,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:42,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:42,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741027284] [2021-12-14 19:46:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:42,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:42,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:42,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:42,033 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 19:46:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:42,342 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2021-12-14 19:46:42,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:42,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-14 19:46:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:42,344 INFO L225 Difference]: With dead ends: 182 [2021-12-14 19:46:42,344 INFO L226 Difference]: Without dead ends: 182 [2021-12-14 19:46:42,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:46:42,345 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 69 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:42,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 186 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:46:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-14 19:46:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2021-12-14 19:46:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 79 states have (on average 1.8987341772151898) internal successors, (150), 142 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 19:46:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2021-12-14 19:46:42,353 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 3 [2021-12-14 19:46:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:42,353 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2021-12-14 19:46:42,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 19:46:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2021-12-14 19:46:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:46:42,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:42,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:42,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:42,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:42,563 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2021-12-14 19:46:42,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:42,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176566585] [2021-12-14 19:46:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:42,565 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:42,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:42,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:42,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 19:46:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:42,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:46:42,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:42,669 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:42,688 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 11 treesize of output 7 [2021-12-14 19:46:42,720 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 20 treesize of output 12 [2021-12-14 19:46:42,739 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 19:46:42,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:42,740 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:42,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176566585] [2021-12-14 19:46:42,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176566585] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:42,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:42,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:42,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842243626] [2021-12-14 19:46:42,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:42,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:42,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:42,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:42,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:42,743 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:43,356 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2021-12-14 19:46:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:43,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:43,358 INFO L225 Difference]: With dead ends: 149 [2021-12-14 19:46:43,358 INFO L226 Difference]: Without dead ends: 149 [2021-12-14 19:46:43,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:46:43,359 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 95 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:43,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 297 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 19:46:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-14 19:46:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2021-12-14 19:46:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 140 states have internal predecessors, (156), 0 states have call successors, (0), 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 19:46:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2021-12-14 19:46:43,366 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 10 [2021-12-14 19:46:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:43,366 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2021-12-14 19:46:43,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2021-12-14 19:46:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:46:43,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:43,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:43,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:43,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:43,568 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:43,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2021-12-14 19:46:43,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:43,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269484963] [2021-12-14 19:46:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:43,570 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:43,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:43,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:43,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 19:46:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:43,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:46:43,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:43,665 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:43,686 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 11 treesize of output 7 [2021-12-14 19:46:43,692 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 11 treesize of output 7 [2021-12-14 19:46:43,722 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 17 treesize of output 9 [2021-12-14 19:46:43,726 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 15 treesize of output 7 [2021-12-14 19:46:43,756 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 19:46:43,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:43,756 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:43,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269484963] [2021-12-14 19:46:43,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269484963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:43,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:43,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:43,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047293916] [2021-12-14 19:46:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:43,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:43,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:43,759 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:44,307 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2021-12-14 19:46:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:44,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:44,308 INFO L225 Difference]: With dead ends: 137 [2021-12-14 19:46:44,308 INFO L226 Difference]: Without dead ends: 137 [2021-12-14 19:46:44,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:46:44,310 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 6 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:44,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:46:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-14 19:46:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-12-14 19:46:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.7272727272727273) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 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 19:46:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2021-12-14 19:46:44,316 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 10 [2021-12-14 19:46:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:44,316 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2021-12-14 19:46:44,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 19:46:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2021-12-14 19:46:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:46:44,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:44,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:44,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:44,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:44,523 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2021-12-14 19:46:44,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803990217] [2021-12-14 19:46:44,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:44,525 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:44,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:44,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:44,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 19:46:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:44,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:46:44,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:44,632 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:44,643 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 11 treesize of output 7 [2021-12-14 19:46:44,658 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 22 treesize of output 14 [2021-12-14 19:46:44,683 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 19:46:44,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:44,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:44,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803990217] [2021-12-14 19:46:44,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803990217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:44,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:44,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:44,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560966639] [2021-12-14 19:46:44,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:44,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:44,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:44,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:44,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:44,685 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 19:46:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:45,171 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2021-12-14 19:46:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:46:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 17 [2021-12-14 19:46:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:45,172 INFO L225 Difference]: With dead ends: 144 [2021-12-14 19:46:45,172 INFO L226 Difference]: Without dead ends: 144 [2021-12-14 19:46:45,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:46:45,173 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 92 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:45,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 289 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:46:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-14 19:46:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2021-12-14 19:46:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.7159090909090908) internal successors, (151), 135 states have internal predecessors, (151), 0 states have call successors, (0), 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 19:46:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2021-12-14 19:46:45,178 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 17 [2021-12-14 19:46:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:45,178 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2021-12-14 19:46:45,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 19:46:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2021-12-14 19:46:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:46:45,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:45,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:45,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:45,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:45,389 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:45,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2021-12-14 19:46:45,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:45,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527758598] [2021-12-14 19:46:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:45,390 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:45,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:45,392 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:45,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 19:46:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:45,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:46:45,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:45,523 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:45,559 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 11 treesize of output 7 [2021-12-14 19:46:45,565 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 11 treesize of output 7 [2021-12-14 19:46:45,590 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 17 treesize of output 9 [2021-12-14 19:46:45,594 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 15 treesize of output 7 [2021-12-14 19:46:45,621 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 19:46:45,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:45,621 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:45,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527758598] [2021-12-14 19:46:45,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527758598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:45,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:45,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:45,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295456849] [2021-12-14 19:46:45,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:45,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:45,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:45,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:45,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:45,623 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 19:46:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:46,075 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2021-12-14 19:46:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:46:46,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 17 [2021-12-14 19:46:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:46,077 INFO L225 Difference]: With dead ends: 135 [2021-12-14 19:46:46,077 INFO L226 Difference]: Without dead ends: 135 [2021-12-14 19:46:46,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:46:46,077 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 7 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:46,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 393 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:46:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-14 19:46:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2021-12-14 19:46:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.6818181818181819) internal successors, (148), 132 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2021-12-14 19:46:46,082 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 17 [2021-12-14 19:46:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:46,083 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2021-12-14 19:46:46,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 19:46:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2021-12-14 19:46:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:46:46,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:46,083 INFO L514 BasicCegarLoop]: trace histogram [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 19:46:46,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:46,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:46,292 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1689679642, now seen corresponding path program 1 times [2021-12-14 19:46:46,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:46,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85969387] [2021-12-14 19:46:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:46,294 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:46,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:46,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:46,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 19:46:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:46,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:46:46,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:46,450 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:46,456 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 19:46:46,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:46,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:46,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85969387] [2021-12-14 19:46:46,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85969387] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:46,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:46,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:46,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577886148] [2021-12-14 19:46:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:46,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:46,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:46,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:46,458 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 19:46:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:46,635 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2021-12-14 19:46:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:46:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:46,636 INFO L225 Difference]: With dead ends: 138 [2021-12-14 19:46:46,636 INFO L226 Difference]: Without dead ends: 138 [2021-12-14 19:46:46,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 19:46:46,637 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 65 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:46,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 139 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-14 19:46:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2021-12-14 19:46:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.625) internal successors, (143), 127 states have internal predecessors, (143), 0 states have call successors, (0), 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 19:46:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2021-12-14 19:46:46,641 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 22 [2021-12-14 19:46:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:46,641 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2021-12-14 19:46:46,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 19:46:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2021-12-14 19:46:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:46:46,642 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:46,642 INFO L514 BasicCegarLoop]: trace histogram [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 19:46:46,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:46,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:46,852 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:46,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1689679643, now seen corresponding path program 1 times [2021-12-14 19:46:46,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:46,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415655727] [2021-12-14 19:46:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:46,853 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:46,854 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:46,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 19:46:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:46,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:46:46,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:47,000 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:47,007 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 19:46:47,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:47,007 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:47,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415655727] [2021-12-14 19:46:47,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415655727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:47,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:47,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:47,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273635064] [2021-12-14 19:46:47,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:47,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:47,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:47,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:47,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:47,010 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 19:46:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:47,174 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2021-12-14 19:46:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:46:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:47,175 INFO L225 Difference]: With dead ends: 133 [2021-12-14 19:46:47,175 INFO L226 Difference]: Without dead ends: 133 [2021-12-14 19:46:47,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 19:46:47,176 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 60 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:47,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 140 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-14 19:46:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2021-12-14 19:46:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 122 states have internal predecessors, (138), 0 states have call successors, (0), 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 19:46:47,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2021-12-14 19:46:47,179 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 22 [2021-12-14 19:46:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:47,179 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2021-12-14 19:46:47,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 19:46:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2021-12-14 19:46:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:46:47,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:47,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:47,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-14 19:46:47,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:47,390 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:47,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 284576519, now seen corresponding path program 1 times [2021-12-14 19:46:47,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:47,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64742184] [2021-12-14 19:46:47,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:47,391 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:47,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:47,391 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:47,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 19:46:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:47,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:46:47,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:47,586 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:46:47,586 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 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-14 19:46:47,660 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 19:46:47,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:47,660 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:47,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64742184] [2021-12-14 19:46:47,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64742184] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:47,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:47,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:46:47,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368198783] [2021-12-14 19:46:47,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:47,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:46:47,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:47,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:46:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:47,662 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 19:46:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:47,876 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2021-12-14 19:46:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:46:47,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 19:46:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:47,877 INFO L225 Difference]: With dead ends: 139 [2021-12-14 19:46:47,878 INFO L226 Difference]: Without dead ends: 139 [2021-12-14 19:46:47,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:46:47,878 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 79 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:47,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 197 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 83 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2021-12-14 19:46:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-14 19:46:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2021-12-14 19:46:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 92 states have (on average 1.576086956521739) internal successors, (145), 126 states have internal predecessors, (145), 0 states have call successors, (0), 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 19:46:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2021-12-14 19:46:47,882 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 24 [2021-12-14 19:46:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:47,882 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2021-12-14 19:46:47,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 19:46:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2021-12-14 19:46:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:46:47,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:47,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:47,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:48,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:48,093 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash 284576520, now seen corresponding path program 1 times [2021-12-14 19:46:48,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:48,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793550154] [2021-12-14 19:46:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:48,094 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:48,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:48,095 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:48,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 19:46:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:48,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:46:48,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:48,258 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:48,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:48,326 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:46:48,326 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 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 19:46:48,343 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:48,343 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 17 treesize of output 17 [2021-12-14 19:46:48,453 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:46:48,453 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 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 19:46:48,469 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:48,469 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 14 treesize of output 14 [2021-12-14 19:46:48,568 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 19:46:48,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:48,568 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793550154] [2021-12-14 19:46:48,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793550154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:48,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:48,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:46:48,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174133140] [2021-12-14 19:46:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:48,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:46:48,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:46:48,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:46:48,570 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 19:46:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:49,179 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2021-12-14 19:46:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:49,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 19:46:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:49,181 INFO L225 Difference]: With dead ends: 221 [2021-12-14 19:46:49,181 INFO L226 Difference]: Without dead ends: 221 [2021-12-14 19:46:49,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:46:49,182 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 369 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:49,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 229 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 19:46:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-14 19:46:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 166. [2021-12-14 19:46:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 131 states have (on average 1.5801526717557253) internal successors, (207), 165 states have internal predecessors, (207), 0 states have call successors, (0), 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 19:46:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2021-12-14 19:46:49,186 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 24 [2021-12-14 19:46:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:49,186 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2021-12-14 19:46:49,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 19:46:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2021-12-14 19:46:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:46:49,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:49,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:49,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:49,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:49,388 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 231938434, now seen corresponding path program 1 times [2021-12-14 19:46:49,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:49,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051963408] [2021-12-14 19:46:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:49,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:49,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:49,390 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:49,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 19:46:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:49,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:46:49,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:49,563 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 19:46:49,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:49,564 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:49,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051963408] [2021-12-14 19:46:49,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051963408] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:49,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:49,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:46:49,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160114607] [2021-12-14 19:46:49,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:49,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:49,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:46:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:49,566 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 19:46:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:49,744 INFO L93 Difference]: Finished difference Result 204 states and 234 transitions. [2021-12-14 19:46:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:46:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 19:46:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:49,745 INFO L225 Difference]: With dead ends: 204 [2021-12-14 19:46:49,745 INFO L226 Difference]: Without dead ends: 204 [2021-12-14 19:46:49,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 19:46:49,746 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 189 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:49,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 210 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-14 19:46:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2021-12-14 19:46:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 130 states have (on average 1.5538461538461539) internal successors, (202), 163 states have internal predecessors, (202), 0 states have call successors, (0), 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 19:46:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2021-12-14 19:46:49,750 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 25 [2021-12-14 19:46:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:49,750 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2021-12-14 19:46:49,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 19:46:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2021-12-14 19:46:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:46:49,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:49,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:49,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-14 19:46:49,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:46:49,959 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-14 19:46:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash -947079159, now seen corresponding path program 1 times [2021-12-14 19:46:49,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:46:49,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673030167] [2021-12-14 19:46:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:49,960 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:46:49,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:46:49,961 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:46:49,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 19:46:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:50,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-14 19:46:50,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:50,168 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:50,198 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 19:46:50,209 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 19:46:50,261 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:50,261 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 14 treesize of output 14 [2021-12-14 19:46:50,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:50,291 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 21 treesize of output 20 [2021-12-14 19:46:50,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:50,301 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 21 treesize of output 20 [2021-12-14 19:46:50,461 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:50,461 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 31 treesize of output 29 [2021-12-14 19:46:50,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:50,476 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 16 treesize of output 18 [2021-12-14 19:46:50,509 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:46:50,509 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 19:46:50,518 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 19:46:50,543 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:50,543 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 31 treesize of output 29 [2021-12-14 19:46:50,616 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:50,616 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 14 treesize of output 14 [2021-12-14 19:46:50,675 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:46:50,676 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 19:46:50,686 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 19:46:50,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:50,729 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-12-14 19:46:50,729 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 2 case distinctions, treesize of input 36 treesize of output 34 [2021-12-14 19:46:50,966 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:46:50,967 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 19:46:50,972 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 19:46:51,010 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:46:51,010 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 47 treesize of output 49 [2021-12-14 19:46:51,037 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 12 treesize of output 8 [2021-12-14 19:46:51,164 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:46:51,164 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 19:46:51,173 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 19:46:51,208 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:46:51,208 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 56 treesize of output 56 [2021-12-14 19:46:51,211 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:46:51,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673030167] [2021-12-14 19:46:51,212 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-14 19:46:51,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1580414320] [2021-12-14 19:46:51,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:51,212 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:46:51,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:46:51,214 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:46:51,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-12-14 19:46:51,294 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1c00636c at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 19:46:51,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959333332] [2021-12-14 19:46:51,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:51,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:51,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:46:51,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 19:46:51,346 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1c00636c at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 19:46:51,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:51,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-14 19:46:51,348 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-12-14 19:46:51,348 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-14 19:46:51,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (71 of 72 remaining) [2021-12-14 19:46:51,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (70 of 72 remaining) [2021-12-14 19:46:51,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (69 of 72 remaining) [2021-12-14 19:46:51,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (68 of 72 remaining) [2021-12-14 19:46:51,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (67 of 72 remaining) [2021-12-14 19:46:51,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (66 of 72 remaining) [2021-12-14 19:46:51,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (65 of 72 remaining) [2021-12-14 19:46:51,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (64 of 72 remaining) [2021-12-14 19:46:51,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (63 of 72 remaining) [2021-12-14 19:46:51,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (62 of 72 remaining) [2021-12-14 19:46:51,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (61 of 72 remaining) [2021-12-14 19:46:51,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (60 of 72 remaining) [2021-12-14 19:46:51,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (59 of 72 remaining) [2021-12-14 19:46:51,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (58 of 72 remaining) [2021-12-14 19:46:51,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (57 of 72 remaining) [2021-12-14 19:46:51,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (56 of 72 remaining) [2021-12-14 19:46:51,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (55 of 72 remaining) [2021-12-14 19:46:51,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (54 of 72 remaining) [2021-12-14 19:46:51,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (53 of 72 remaining) [2021-12-14 19:46:51,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (52 of 72 remaining) [2021-12-14 19:46:51,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (51 of 72 remaining) [2021-12-14 19:46:51,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (50 of 72 remaining) [2021-12-14 19:46:51,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (49 of 72 remaining) [2021-12-14 19:46:51,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (48 of 72 remaining) [2021-12-14 19:46:51,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (47 of 72 remaining) [2021-12-14 19:46:51,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (46 of 72 remaining) [2021-12-14 19:46:51,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (45 of 72 remaining) [2021-12-14 19:46:51,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (44 of 72 remaining) [2021-12-14 19:46:51,358 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (43 of 72 remaining) [2021-12-14 19:46:51,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (42 of 72 remaining) [2021-12-14 19:46:51,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (41 of 72 remaining) [2021-12-14 19:46:51,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (40 of 72 remaining) [2021-12-14 19:46:51,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (39 of 72 remaining) [2021-12-14 19:46:51,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (38 of 72 remaining) [2021-12-14 19:46:51,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (37 of 72 remaining) [2021-12-14 19:46:51,359 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (36 of 72 remaining) [2021-12-14 19:46:51,360 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (35 of 72 remaining) [2021-12-14 19:46:51,360 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (34 of 72 remaining) [2021-12-14 19:46:51,360 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (33 of 72 remaining) [2021-12-14 19:46:51,360 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK (32 of 72 remaining) [2021-12-14 19:46:51,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (31 of 72 remaining) [2021-12-14 19:46:51,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (30 of 72 remaining) [2021-12-14 19:46:51,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (29 of 72 remaining) [2021-12-14 19:46:51,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (28 of 72 remaining) [2021-12-14 19:46:51,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (27 of 72 remaining) [2021-12-14 19:46:51,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (26 of 72 remaining) [2021-12-14 19:46:51,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (25 of 72 remaining) [2021-12-14 19:46:51,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (24 of 72 remaining) [2021-12-14 19:46:51,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (23 of 72 remaining) [2021-12-14 19:46:51,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (22 of 72 remaining) [2021-12-14 19:46:51,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (21 of 72 remaining) [2021-12-14 19:46:51,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (20 of 72 remaining) [2021-12-14 19:46:51,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (19 of 72 remaining) [2021-12-14 19:46:51,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (18 of 72 remaining) [2021-12-14 19:46:51,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (17 of 72 remaining) [2021-12-14 19:46:51,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (16 of 72 remaining) [2021-12-14 19:46:51,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (15 of 72 remaining) [2021-12-14 19:46:51,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (14 of 72 remaining) [2021-12-14 19:46:51,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (13 of 72 remaining) [2021-12-14 19:46:51,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (12 of 72 remaining) [2021-12-14 19:46:51,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (11 of 72 remaining) [2021-12-14 19:46:51,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK (10 of 72 remaining) [2021-12-14 19:46:51,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (9 of 72 remaining) [2021-12-14 19:46:51,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (8 of 72 remaining) [2021-12-14 19:46:51,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (7 of 72 remaining) [2021-12-14 19:46:51,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK (6 of 72 remaining) [2021-12-14 19:46:51,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (5 of 72 remaining) [2021-12-14 19:46:51,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (4 of 72 remaining) [2021-12-14 19:46:51,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (3 of 72 remaining) [2021-12-14 19:46:51,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (2 of 72 remaining) [2021-12-14 19:46:51,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (1 of 72 remaining) [2021-12-14 19:46:51,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK (0 of 72 remaining) [2021-12-14 19:46:51,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:51,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:51,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:51,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:51,971 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:51,973 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:46:51,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:46:51 BoogieIcfgContainer [2021-12-14 19:46:51,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:46:51,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:46:51,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:46:51,984 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:46:51,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:41" (3/4) ... [2021-12-14 19:46:51,987 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 19:46:51,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:46:51,987 INFO L158 Benchmark]: Toolchain (without parser) took 12437.17ms. Allocated memory was 54.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Free memory was 30.5MB in the beginning and 41.5MB in the end (delta: -10.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2021-12-14 19:46:51,988 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 54.5MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:46:51,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.75ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.3MB in the beginning and 46.7MB in the end (delta: -16.3MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2021-12-14 19:46:51,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.99ms. Allocated memory is still 71.3MB. Free memory was 46.5MB in the beginning and 44.3MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 19:46:51,988 INFO L158 Benchmark]: Boogie Preprocessor took 67.47ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 42.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:46:51,989 INFO L158 Benchmark]: RCFGBuilder took 876.18ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 49.1MB in the end (delta: -7.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2021-12-14 19:46:51,989 INFO L158 Benchmark]: TraceAbstraction took 10971.59ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 48.8MB in the beginning and 42.3MB in the end (delta: 6.5MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2021-12-14 19:46:51,989 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 86.0MB. Free memory was 42.3MB in the beginning and 41.5MB in the end (delta: 810.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:46:51,990 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 54.5MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.75ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.3MB in the beginning and 46.7MB in the end (delta: -16.3MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.99ms. Allocated memory is still 71.3MB. Free memory was 46.5MB in the beginning and 44.3MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.47ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 42.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 876.18ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 49.1MB in the end (delta: -7.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10971.59ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 48.8MB in the beginning and 42.3MB in the end (delta: 6.5MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 86.0MB. Free memory was 42.3MB in the beginning and 41.5MB in the end (delta: 810.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1004] BCK* bucket = malloc(sizeof(BCK)); [L1005] bucket->data = 0 [L1006] bucket->list = ((void*)0) [L1008] bucket->next = malloc(sizeof(BCK)) [L1009] EXPR bucket->next [L1009] BCK* bcki = bucket->next; [L1010] bcki->data = 1 [L1011] bcki->list = ((void*)0) [L1013] bcki->next = malloc(sizeof(BCK)) [L1014] EXPR bcki->next [L1014] bcki = bcki->next [L1015] bcki->data = 2 [L1016] bcki->list = ((void*)0) [L1017] bcki->next = ((void*)0) [L1019] struct TSLL* item = ((void*)0); [L1020] struct TSLL* itr = ((void*)0); [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1052] bcki = bucket [L1053] COND TRUE bcki != ((void*)0) [L1055] EXPR bcki->list [L1055] item = bcki->list [L1056] bcki->list = ((void*)0) [L1057] COND TRUE item != ((void*)0) [L1059] itr = item [L1060] item->next - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 72 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1170 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 2604 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 66 IncrementalHoareTripleChecker+Unchecked, 1537 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1889 IncrementalHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 1067 mSDtfsCounter, 1889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 221 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 166 ConstructedInterpolants, 1 QuantifiedInterpolants, 851 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1602 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-14 19:46:52,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN