./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 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/ldv-memsafety/memleaks_test14_2.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 d789cb2558e3de4d1d16c03a2a21714577a96d35a26f84712733ec2a50aa0d89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:09:47,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:09:47,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:09:47,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:09:47,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:09:47,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:09:47,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:09:47,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:09:47,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:09:47,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:09:47,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:09:47,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:09:47,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:09:47,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:09:47,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:09:47,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:09:47,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:09:47,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:09:47,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:09:47,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:09:47,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:09:47,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:09:47,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:09:47,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:09:47,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:09:47,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:09:47,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:09:47,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:09:47,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:09:47,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:09:47,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:09:47,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:09:47,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:09:47,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:09:47,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:09:47,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:09:47,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:09:47,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:09:47,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:09:47,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:09:47,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:09:47,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-21 18:09:47,544 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:09:47,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:09:47,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:09:47,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:09:47,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:09:47,547 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:09:47,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:09:47,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:09:47,547 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:09:47,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:09:47,548 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:09:47,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:09:47,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:09:47,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:09:47,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:09:47,549 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:09:47,549 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:09:47,550 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:09:47,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:09:47,550 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:09:47,550 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:09:47,550 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:09:47,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:09:47,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:09:47,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:09:47,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:09:47,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:09:47,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:09:47,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:09:47,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:09:47,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:09:47,553 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 -> d789cb2558e3de4d1d16c03a2a21714577a96d35a26f84712733ec2a50aa0d89 [2021-12-21 18:09:47,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:09:47,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:09:47,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:09:47,822 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:09:47,823 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:09:47,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2021-12-21 18:09:47,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/064e196bf/c4a612268013466db5e681188f6010db/FLAG0868230b8 [2021-12-21 18:09:48,377 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:09:48,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2021-12-21 18:09:48,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/064e196bf/c4a612268013466db5e681188f6010db/FLAG0868230b8 [2021-12-21 18:09:48,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/064e196bf/c4a612268013466db5e681188f6010db [2021-12-21 18:09:48,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:09:48,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:09:48,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:09:48,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:09:48,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:09:48,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:09:48" (1/1) ... [2021-12-21 18:09:48,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555d733d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:48, skipping insertion in model container [2021-12-21 18:09:48,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:09:48" (1/1) ... [2021-12-21 18:09:48,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:09:48,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:09:48,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:09:48,809 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-21 18:09:48,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25344320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:48, skipping insertion in model container [2021-12-21 18:09:48,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:09:48,811 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-21 18:09:48,813 INFO L158 Benchmark]: Toolchain (without parser) took 402.68ms. Allocated memory is still 100.7MB. Free memory was 66.3MB in the beginning and 73.3MB in the end (delta: -6.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 18:09:48,814 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 100.7MB. Free memory was 73.0MB in the beginning and 73.0MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:09:48,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.92ms. Allocated memory is still 100.7MB. Free memory was 66.1MB in the beginning and 73.3MB in the end (delta: -7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 18:09:48,817 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.28ms. Allocated memory is still 100.7MB. Free memory was 73.0MB in the beginning and 73.0MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.92ms. Allocated memory is still 100.7MB. Free memory was 66.1MB in the beginning and 73.3MB in the end (delta: -7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/ldv-memsafety/memleaks_test14_2.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 d789cb2558e3de4d1d16c03a2a21714577a96d35a26f84712733ec2a50aa0d89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:09:50,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:09:50,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:09:50,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:09:50,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:09:50,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:09:50,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:09:50,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:09:50,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:09:50,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:09:50,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:09:50,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:09:50,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:09:50,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:09:50,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:09:50,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:09:50,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:09:50,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:09:50,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:09:50,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:09:50,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:09:50,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:09:50,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:09:50,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:09:50,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:09:50,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:09:50,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:09:50,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:09:50,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:09:50,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:09:50,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:09:50,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:09:50,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:09:50,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:09:50,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:09:50,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:09:50,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:09:50,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:09:50,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:09:50,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:09:50,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:09:50,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-21 18:09:50,498 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:09:50,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:09:50,500 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:09:50,500 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:09:50,501 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:09:50,501 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:09:50,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:09:50,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:09:50,502 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:09:50,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:09:50,503 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:09:50,503 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:09:50,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:09:50,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:09:50,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:09:50,504 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:09:50,504 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:09:50,504 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:09:50,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:09:50,504 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:09:50,505 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 18:09:50,505 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 18:09:50,505 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:09:50,505 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:09:50,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:09:50,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:09:50,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:09:50,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:09:50,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:09:50,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:09:50,506 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 18:09:50,506 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 18:09:50,507 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:09:50,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 18:09:50,507 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 -> d789cb2558e3de4d1d16c03a2a21714577a96d35a26f84712733ec2a50aa0d89 [2021-12-21 18:09:50,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:09:50,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:09:50,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:09:50,805 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:09:50,806 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:09:50,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2021-12-21 18:09:50,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b0ae608/60e949a8bc9d4f36bbf227dd0b88bb5c/FLAGc43aea54e [2021-12-21 18:09:51,335 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:09:51,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test14_2.i [2021-12-21 18:09:51,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b0ae608/60e949a8bc9d4f36bbf227dd0b88bb5c/FLAGc43aea54e [2021-12-21 18:09:51,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b0ae608/60e949a8bc9d4f36bbf227dd0b88bb5c [2021-12-21 18:09:51,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:09:51,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:09:51,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:09:51,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:09:51,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:09:51,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:09:51" (1/1) ... [2021-12-21 18:09:51,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b170be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:51, skipping insertion in model container [2021-12-21 18:09:51,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:09:51" (1/1) ... [2021-12-21 18:09:51,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:09:51,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:09:51,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:09:52,007 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-21 18:09:52,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:09:52,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:09:52,080 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:09:52,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:09:52,143 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:09:52,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52 WrapperNode [2021-12-21 18:09:52,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:09:52,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:09:52,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:09:52,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:09:52,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,186 INFO L137 Inliner]: procedures = 168, calls = 79, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 55 [2021-12-21 18:09:52,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:09:52,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:09:52,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:09:52,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:09:52,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:09:52,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:09:52,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:09:52,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:09:52,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (1/1) ... [2021-12-21 18:09:52,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:09:52,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:09:52,259 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-21 18:09:52,261 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-21 18:09:52,289 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2021-12-21 18:09:52,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2021-12-21 18:09:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-21 18:09:52,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-21 18:09:52,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2021-12-21 18:09:52,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2021-12-21 18:09:52,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:09:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:09:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 18:09:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:09:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:09:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:09:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 18:09:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2021-12-21 18:09:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2021-12-21 18:09:52,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:09:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:09:52,414 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:09:52,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:09:52,758 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:09:52,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:09:52,769 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 18:09:52,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:09:52 BoogieIcfgContainer [2021-12-21 18:09:52,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:09:52,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:09:52,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:09:52,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:09:52,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:09:51" (1/3) ... [2021-12-21 18:09:52,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3234cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:09:52, skipping insertion in model container [2021-12-21 18:09:52,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:09:52" (2/3) ... [2021-12-21 18:09:52,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3234cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:09:52, skipping insertion in model container [2021-12-21 18:09:52,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:09:52" (3/3) ... [2021-12-21 18:09:52,784 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test14_2.i [2021-12-21 18:09:52,790 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:09:52,790 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-12-21 18:09:52,835 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:09:52,851 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-21 18:09:52,858 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-12-21 18:09:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 38 states have (on average 1.763157894736842) internal successors, (67), 64 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:09:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 18:09:52,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:09:52,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:09:52,882 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:09:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:09:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash 225826608, now seen corresponding path program 1 times [2021-12-21 18:09:52,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:09:52,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110105994] [2021-12-21 18:09:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:09:52,900 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:09:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:09:52,902 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-21 18:09:52,903 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-21 18:09:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:09:53,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:09:53,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:09:53,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:09:53,185 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 18:09:53,186 INFO L387 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 17 [2021-12-21 18:09:53,231 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-21 18:09:53,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:09:53,232 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:09:53,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110105994] [2021-12-21 18:09:53,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110105994] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:09:53,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:09:53,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:09:53,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228249269] [2021-12-21 18:09:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:09:53,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:09:53,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:09:53,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:09:53,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:09:53,267 INFO L87 Difference]: Start difference. First operand has 72 states, 38 states have (on average 1.763157894736842) internal successors, (67), 64 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:09:53,591 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-12-21 18:09:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:09:53,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-12-21 18:09:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:09:53,601 INFO L225 Difference]: With dead ends: 73 [2021-12-21 18:09:53,601 INFO L226 Difference]: Without dead ends: 71 [2021-12-21 18:09:53,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:09:53,606 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 68 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:09:53,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 121 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2021-12-21 18:09:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-21 18:09:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2021-12-21 18:09:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:09:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2021-12-21 18:09:53,638 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 12 [2021-12-21 18:09:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:09:53,639 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2021-12-21 18:09:53,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2021-12-21 18:09:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 18:09:53,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:09:53,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:09:53,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-21 18:09:53,853 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-21 18:09:53,854 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:09:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:09:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash 225826609, now seen corresponding path program 1 times [2021-12-21 18:09:53,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:09:53,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391018142] [2021-12-21 18:09:53,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:09:53,856 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:09:53,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:09:53,861 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-21 18:09:53,863 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-21 18:09:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:09:53,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 18:09:53,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:09:53,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:09:53,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:09:54,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:09:54,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-21 18:09:54,061 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:09:54,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:09:54,153 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-21 18:09:54,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:09:54,154 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:09:54,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391018142] [2021-12-21 18:09:54,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391018142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:09:54,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:09:54,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:09:54,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689820489] [2021-12-21 18:09:54,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:09:54,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:09:54,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:09:54,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:09:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:09:54,158 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:09:54,523 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2021-12-21 18:09:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:09:54,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-12-21 18:09:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:09:54,526 INFO L225 Difference]: With dead ends: 90 [2021-12-21 18:09:54,526 INFO L226 Difference]: Without dead ends: 90 [2021-12-21 18:09:54,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:09:54,528 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 87 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:09:54,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 158 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 63 Unchecked, 0.3s Time] [2021-12-21 18:09:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-21 18:09:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2021-12-21 18:09:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:09:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-12-21 18:09:54,537 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 12 [2021-12-21 18:09:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:09:54,538 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-12-21 18:09:54,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-12-21 18:09:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:09:54,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:09:54,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:09:54,564 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-21 18:09:54,749 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-21 18:09:54,749 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:09:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:09:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash 838569493, now seen corresponding path program 1 times [2021-12-21 18:09:54,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:09:54,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950295434] [2021-12-21 18:09:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:09:54,751 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:09:54,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:09:54,768 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-21 18:09:54,776 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-21 18:09:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:09:54,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:09:54,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:09:54,882 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-21 18:09:54,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:09:54,883 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:09:54,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950295434] [2021-12-21 18:09:54,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950295434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:09:54,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:09:54,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:09:54,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566716470] [2021-12-21 18:09:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:09:54,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:09:54,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:09:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:09:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:09:54,886 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:09:54,902 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2021-12-21 18:09:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:09:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-21 18:09:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:09:54,904 INFO L225 Difference]: With dead ends: 93 [2021-12-21 18:09:54,904 INFO L226 Difference]: Without dead ends: 93 [2021-12-21 18:09:54,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:09:54,906 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 20 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:09:54,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 334 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:09:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-21 18:09:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2021-12-21 18:09:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.625) internal successors, (65), 63 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:09:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2021-12-21 18:09:54,914 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 11 [2021-12-21 18:09:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:09:54,914 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-12-21 18:09:54,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2021-12-21 18:09:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:09:54,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:09:54,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:09:54,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-21 18:09:55,125 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-21 18:09:55,126 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:09:55,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:09:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1726073174, now seen corresponding path program 1 times [2021-12-21 18:09:55,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:09:55,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733896687] [2021-12-21 18:09:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:09:55,128 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:09:55,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:09:55,133 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-21 18:09:55,135 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-21 18:09:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:09:55,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:09:55,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:09:55,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:09:55,232 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-21 18:09:55,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:09:55,233 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:09:55,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733896687] [2021-12-21 18:09:55,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733896687] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:09:55,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:09:55,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:09:55,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34058944] [2021-12-21 18:09:55,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:09:55,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:09:55,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:09:55,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:09:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:09:55,236 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:09:55,481 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2021-12-21 18:09:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:09:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-21 18:09:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:09:55,483 INFO L225 Difference]: With dead ends: 89 [2021-12-21 18:09:55,483 INFO L226 Difference]: Without dead ends: 89 [2021-12-21 18:09:55,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:09:55,484 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 76 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:09:55,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 85 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:09:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-21 18:09:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2021-12-21 18:09:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.619047619047619) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-21 18:09:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2021-12-21 18:09:55,491 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 11 [2021-12-21 18:09:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:09:55,491 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2021-12-21 18:09:55,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2021-12-21 18:09:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:09:55,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:09:55,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:09:55,500 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-21 18:09:55,700 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-21 18:09:55,700 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:09:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:09:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1726073175, now seen corresponding path program 1 times [2021-12-21 18:09:55,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:09:55,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175146942] [2021-12-21 18:09:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:09:55,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:09:55,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:09:55,703 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-21 18:09:55,705 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-21 18:09:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:09:55,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 18:09:55,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:09:55,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:09:55,818 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-21 18:09:55,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:09:55,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:09:55,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175146942] [2021-12-21 18:09:55,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175146942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:09:55,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:09:55,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:09:55,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250102381] [2021-12-21 18:09:55,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:09:55,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:09:55,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:09:55,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:09:55,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:09:55,821 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:09:56,089 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-12-21 18:09:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:09:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-21 18:09:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:09:56,091 INFO L225 Difference]: With dead ends: 91 [2021-12-21 18:09:56,091 INFO L226 Difference]: Without dead ends: 91 [2021-12-21 18:09:56,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:09:56,092 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 64 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:09:56,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 100 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:09:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-21 18:09:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2021-12-21 18:09:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 65 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-21 18:09:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-12-21 18:09:56,098 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 11 [2021-12-21 18:09:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:09:56,098 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-12-21 18:09:56,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-12-21 18:09:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:09:56,099 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:09:56,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:09:56,128 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-21 18:09:56,330 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-21 18:09:56,330 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:09:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:09:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1681752525, now seen corresponding path program 1 times [2021-12-21 18:09:56,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:09:56,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678817718] [2021-12-21 18:09:56,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:09:56,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:09:56,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:09:56,333 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-21 18:09:56,338 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-21 18:09:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:09:56,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-21 18:09:56,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:09:56,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:09:56,530 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-21 18:09:56,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:09:56,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:09:56,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678817718] [2021-12-21 18:09:56,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678817718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:09:56,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:09:56,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:09:56,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977613043] [2021-12-21 18:09:56,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:09:56,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:09:56,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:09:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:09:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:09:56,533 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:09:56,777 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-12-21 18:09:56,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:09:56,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-12-21 18:09:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:09:56,778 INFO L225 Difference]: With dead ends: 87 [2021-12-21 18:09:56,778 INFO L226 Difference]: Without dead ends: 87 [2021-12-21 18:09:56,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:09:56,779 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:09:56,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 322 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2021-12-21 18:09:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-21 18:09:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2021-12-21 18:09:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-21 18:09:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-12-21 18:09:56,785 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 15 [2021-12-21 18:09:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:09:56,786 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-12-21 18:09:56,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:09:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-12-21 18:09:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:09:56,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:09:56,787 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:09:56,796 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-21 18:09:56,996 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-21 18:09:56,996 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:09:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:09:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1681752526, now seen corresponding path program 1 times [2021-12-21 18:09:56,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:09:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262733918] [2021-12-21 18:09:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:09:56,997 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:09:56,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:09:56,999 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-21 18:09:57,003 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-21 18:09:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:09:57,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 18:09:57,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:09:57,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:09:57,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:09:57,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:09:57,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:09:59,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:09:59,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-21 18:09:59,319 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:09:59,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:09:59,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:09:59,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:09:59,639 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-21 18:09:59,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:09:59,640 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:09:59,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262733918] [2021-12-21 18:09:59,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262733918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:09:59,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:09:59,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:09:59,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234209708] [2021-12-21 18:09:59,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:09:59,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:09:59,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:09:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:09:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=89, Unknown=1, NotChecked=0, Total=110 [2021-12-21 18:09:59,643 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:00,169 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2021-12-21 18:10:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 18:10:00,170 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-12-21 18:10:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:00,171 INFO L225 Difference]: With dead ends: 91 [2021-12-21 18:10:00,171 INFO L226 Difference]: Without dead ends: 91 [2021-12-21 18:10:00,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2021-12-21 18:10:00,172 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:00,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 346 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 130 Unchecked, 0.4s Time] [2021-12-21 18:10:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-21 18:10:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2021-12-21 18:10:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.6) internal successors, (80), 72 states have internal predecessors, (80), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-12-21 18:10:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2021-12-21 18:10:00,177 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 15 [2021-12-21 18:10:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:00,177 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2021-12-21 18:10:00,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2021-12-21 18:10:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:10:00,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:00,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:00,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-21 18:10:00,378 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-21 18:10:00,379 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash -115198833, now seen corresponding path program 1 times [2021-12-21 18:10:00,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:00,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775470798] [2021-12-21 18:10:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:00,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:00,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:00,386 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-21 18:10:00,404 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-21 18:10:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:00,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:10:00,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:00,529 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-21 18:10:00,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:00,530 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:00,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775470798] [2021-12-21 18:10:00,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775470798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:00,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:00,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:10:00,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195418386] [2021-12-21 18:10:00,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:00,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:10:00,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:10:00,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:10:00,531 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:00,547 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2021-12-21 18:10:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:10:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-12-21 18:10:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:00,549 INFO L225 Difference]: With dead ends: 88 [2021-12-21 18:10:00,549 INFO L226 Difference]: Without dead ends: 88 [2021-12-21 18:10:00,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:10:00,550 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 18 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:00,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 270 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:10:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-21 18:10:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2021-12-21 18:10:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 62 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:10:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2021-12-21 18:10:00,565 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 15 [2021-12-21 18:10:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:00,566 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2021-12-21 18:10:00,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2021-12-21 18:10:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 18:10:00,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:00,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:00,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:00,778 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-21 18:10:00,778 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash 898943928, now seen corresponding path program 1 times [2021-12-21 18:10:00,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:00,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329393380] [2021-12-21 18:10:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:00,781 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:00,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:00,782 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-21 18:10:00,846 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-21 18:10:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:00,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 18:10:00,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:00,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:00,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:10:01,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:10:01,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:10:01,198 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-21 18:10:01,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:01,199 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:01,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329393380] [2021-12-21 18:10:01,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329393380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:01,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:01,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:10:01,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724469123] [2021-12-21 18:10:01,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:01,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:10:01,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:01,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:10:01,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:10:01,202 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:01,727 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2021-12-21 18:10:01,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:10:01,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-21 18:10:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:01,728 INFO L225 Difference]: With dead ends: 83 [2021-12-21 18:10:01,729 INFO L226 Difference]: Without dead ends: 83 [2021-12-21 18:10:01,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:10:01,729 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:01,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 228 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 53 Unchecked, 0.3s Time] [2021-12-21 18:10:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-21 18:10:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2021-12-21 18:10:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 64 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:10:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2021-12-21 18:10:01,733 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 13 [2021-12-21 18:10:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:01,733 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2021-12-21 18:10:01,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2021-12-21 18:10:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 18:10:01,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:01,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:01,750 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-21 18:10:01,947 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-21 18:10:01,947 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 898943927, now seen corresponding path program 1 times [2021-12-21 18:10:01,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:01,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395125673] [2021-12-21 18:10:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:01,948 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:01,950 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-21 18:10:01,952 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-21 18:10:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:02,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 18:10:02,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:02,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-21 18:10:02,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:10:02,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:10:02,177 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-21 18:10:02,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:02,177 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:02,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395125673] [2021-12-21 18:10:02,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395125673] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:02,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:02,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:10:02,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476618370] [2021-12-21 18:10:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:02,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:10:02,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:10:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:10:02,179 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:02,449 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2021-12-21 18:10:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:10:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-21 18:10:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:02,450 INFO L225 Difference]: With dead ends: 82 [2021-12-21 18:10:02,451 INFO L226 Difference]: Without dead ends: 82 [2021-12-21 18:10:02,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:10:02,451 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:02,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 222 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2021-12-21 18:10:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-21 18:10:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2021-12-21 18:10:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.5) internal successors, (66), 64 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:10:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2021-12-21 18:10:02,455 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 13 [2021-12-21 18:10:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:02,455 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2021-12-21 18:10:02,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2021-12-21 18:10:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 18:10:02,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:02,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:02,468 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-21 18:10:02,668 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-21 18:10:02,669 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash 594720773, now seen corresponding path program 1 times [2021-12-21 18:10:02,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:02,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763178779] [2021-12-21 18:10:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:02,670 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:02,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:02,684 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-21 18:10:02,696 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-21 18:10:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:02,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:10:02,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:02,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:02,873 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-21 18:10:02,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:02,873 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:02,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763178779] [2021-12-21 18:10:02,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763178779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:02,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:02,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:10:02,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606751343] [2021-12-21 18:10:02,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:02,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:10:02,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:02,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:10:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:10:02,874 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:03,224 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2021-12-21 18:10:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:10:03,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-12-21 18:10:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:03,225 INFO L225 Difference]: With dead ends: 81 [2021-12-21 18:10:03,225 INFO L226 Difference]: Without dead ends: 81 [2021-12-21 18:10:03,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:10:03,226 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:03,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 307 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:10:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-21 18:10:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2021-12-21 18:10:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 62 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:10:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2021-12-21 18:10:03,231 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 16 [2021-12-21 18:10:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:03,231 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2021-12-21 18:10:03,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2021-12-21 18:10:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 18:10:03,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:03,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:03,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:03,441 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-21 18:10:03,442 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:03,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash 594720774, now seen corresponding path program 1 times [2021-12-21 18:10:03,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:03,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247019928] [2021-12-21 18:10:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:03,443 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:03,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:03,445 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-21 18:10:03,446 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-21 18:10:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:03,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 18:10:03,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:03,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:03,710 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-21 18:10:03,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:03,710 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:03,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247019928] [2021-12-21 18:10:03,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247019928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:03,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:03,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:10:03,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773357586] [2021-12-21 18:10:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:03,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 18:10:03,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:03,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 18:10:03,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:10:03,712 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:04,142 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2021-12-21 18:10:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:10:04,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-12-21 18:10:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:04,144 INFO L225 Difference]: With dead ends: 82 [2021-12-21 18:10:04,144 INFO L226 Difference]: Without dead ends: 82 [2021-12-21 18:10:04,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:10:04,145 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 43 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:04,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 394 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:10:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-21 18:10:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2021-12-21 18:10:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:10:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-12-21 18:10:04,148 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 16 [2021-12-21 18:10:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:04,148 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-12-21 18:10:04,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-12-21 18:10:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 18:10:04,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:04,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:04,162 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-21 18:10:04,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:04,360 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __ldv_list_addErr6REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash 296014184, now seen corresponding path program 1 times [2021-12-21 18:10:04,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139600477] [2021-12-21 18:10:04,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:04,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:04,363 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:04,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-21 18:10:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:04,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:10:04,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:04,490 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-21 18:10:04,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:04,490 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:04,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139600477] [2021-12-21 18:10:04,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139600477] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:04,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:04,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:10:04,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999210046] [2021-12-21 18:10:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:04,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:10:04,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:10:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:10:04,492 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:04,614 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2021-12-21 18:10:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:10:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-12-21 18:10:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:04,615 INFO L225 Difference]: With dead ends: 69 [2021-12-21 18:10:04,615 INFO L226 Difference]: Without dead ends: 69 [2021-12-21 18:10:04,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:10:04,616 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:04,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 153 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:10:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-21 18:10:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-21 18:10:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:10:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-12-21 18:10:04,619 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 18 [2021-12-21 18:10:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:04,619 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-12-21 18:10:04,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-12-21 18:10:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 18:10:04,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:04,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:04,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:04,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:04,830 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __ldv_list_addErr7REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:04,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash 296014185, now seen corresponding path program 1 times [2021-12-21 18:10:04,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:04,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950132417] [2021-12-21 18:10:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:04,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:04,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:04,832 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:04,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-21 18:10:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:04,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:10:04,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:05,110 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-21 18:10:05,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:05,111 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:05,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950132417] [2021-12-21 18:10:05,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950132417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:05,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:05,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:10:05,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093834416] [2021-12-21 18:10:05,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:05,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:10:05,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:05,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:10:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:10:05,113 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:05,446 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2021-12-21 18:10:05,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:10:05,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-12-21 18:10:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:05,448 INFO L225 Difference]: With dead ends: 68 [2021-12-21 18:10:05,448 INFO L226 Difference]: Without dead ends: 68 [2021-12-21 18:10:05,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:10:05,449 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 37 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:05,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 250 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:10:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-21 18:10:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-21 18:10:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 58 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:10:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2021-12-21 18:10:05,457 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 18 [2021-12-21 18:10:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:05,457 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2021-12-21 18:10:05,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2021-12-21 18:10:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 18:10:05,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:05,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:05,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:05,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:05,673 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_list_delErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:05,673 INFO L85 PathProgramCache]: Analyzing trace with hash -953601884, now seen corresponding path program 1 times [2021-12-21 18:10:05,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:05,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403503342] [2021-12-21 18:10:05,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:05,675 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:05,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:05,692 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:05,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-21 18:10:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:05,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 18:10:05,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:05,897 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:10:05,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-21 18:10:05,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:10:05,969 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-21 18:10:05,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:05,969 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:05,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403503342] [2021-12-21 18:10:05,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403503342] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:05,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:05,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:10:05,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053186749] [2021-12-21 18:10:05,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:05,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:10:05,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:05,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:10:05,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:10:05,971 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:06,200 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2021-12-21 18:10:06,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:10:06,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-12-21 18:10:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:06,202 INFO L225 Difference]: With dead ends: 74 [2021-12-21 18:10:06,202 INFO L226 Difference]: Without dead ends: 74 [2021-12-21 18:10:06,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:10:06,202 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 18 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:06,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 274 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2021-12-21 18:10:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-21 18:10:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2021-12-21 18:10:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:10:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-12-21 18:10:06,205 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 18 [2021-12-21 18:10:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:06,205 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-12-21 18:10:06,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-12-21 18:10:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 18:10:06,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:06,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:06,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-21 18:10:06,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:06,407 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash -953703910, now seen corresponding path program 1 times [2021-12-21 18:10:06,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:06,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894370480] [2021-12-21 18:10:06,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:06,409 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:06,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:06,410 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:06,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-21 18:10:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:06,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:10:06,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:06,599 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-21 18:10:06,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:06,599 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:06,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894370480] [2021-12-21 18:10:06,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894370480] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:06,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:06,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:10:06,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76322262] [2021-12-21 18:10:06,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:06,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:10:06,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:10:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:10:06,601 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:06,665 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2021-12-21 18:10:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:10:06,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-12-21 18:10:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:06,666 INFO L225 Difference]: With dead ends: 73 [2021-12-21 18:10:06,666 INFO L226 Difference]: Without dead ends: 60 [2021-12-21 18:10:06,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:10:06,667 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:06,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 99 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2021-12-21 18:10:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-21 18:10:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-21 18:10:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 51 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:10:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2021-12-21 18:10:06,669 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 18 [2021-12-21 18:10:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:06,669 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2021-12-21 18:10:06,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:10:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2021-12-21 18:10:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 18:10:06,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:06,670 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-21 18:10:06,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:06,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:06,876 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 783634007, now seen corresponding path program 1 times [2021-12-21 18:10:06,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:06,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720053006] [2021-12-21 18:10:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:06,878 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:06,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:06,879 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:06,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-21 18:10:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:06,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:10:06,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:07,099 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-21 18:10:07,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:07,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:07,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720053006] [2021-12-21 18:10:07,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720053006] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:07,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:07,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:10:07,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8963705] [2021-12-21 18:10:07,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:07,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:10:07,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:07,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:10:07,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:10:07,101 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 18:10:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:07,239 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2021-12-21 18:10:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:10:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-21 18:10:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:07,240 INFO L225 Difference]: With dead ends: 59 [2021-12-21 18:10:07,240 INFO L226 Difference]: Without dead ends: 59 [2021-12-21 18:10:07,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:10:07,241 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:07,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 176 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2021-12-21 18:10:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-21 18:10:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-21 18:10:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 50 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:10:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2021-12-21 18:10:07,243 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 25 [2021-12-21 18:10:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:07,244 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2021-12-21 18:10:07,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 18:10:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2021-12-21 18:10:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 18:10:07,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:07,244 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-21 18:10:07,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:07,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:07,452 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 783634008, now seen corresponding path program 1 times [2021-12-21 18:10:07,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:07,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231205605] [2021-12-21 18:10:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:07,453 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:07,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:07,454 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:07,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-21 18:10:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:07,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 18:10:07,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:07,713 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-21 18:10:07,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:07,713 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:07,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231205605] [2021-12-21 18:10:07,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231205605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:07,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:07,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:10:07,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860627312] [2021-12-21 18:10:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:07,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:10:07,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:07,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:10:07,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:10:07,715 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 18:10:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:08,001 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2021-12-21 18:10:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:10:08,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-21 18:10:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:08,003 INFO L225 Difference]: With dead ends: 58 [2021-12-21 18:10:08,003 INFO L226 Difference]: Without dead ends: 58 [2021-12-21 18:10:08,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:10:08,003 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:08,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 187 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:10:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-21 18:10:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-12-21 18:10:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 49 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:10:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2021-12-21 18:10:08,005 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 25 [2021-12-21 18:10:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:08,005 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2021-12-21 18:10:08,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 18:10:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2021-12-21 18:10:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 18:10:08,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:08,006 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] [2021-12-21 18:10:08,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:08,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:08,206 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1453003897, now seen corresponding path program 1 times [2021-12-21 18:10:08,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:08,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565682344] [2021-12-21 18:10:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:08,208 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:08,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:08,209 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:08,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-21 18:10:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:08,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-21 18:10:08,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:08,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:08,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:08,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:08,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:10:08,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-21 18:10:08,939 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-21 18:10:08,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:08,939 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:08,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565682344] [2021-12-21 18:10:08,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565682344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:08,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:08,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-21 18:10:08,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918430441] [2021-12-21 18:10:08,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:08,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-21 18:10:08,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-21 18:10:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-12-21 18:10:08,940 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:09,194 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2021-12-21 18:10:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 18:10:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2021-12-21 18:10:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:09,196 INFO L225 Difference]: With dead ends: 66 [2021-12-21 18:10:09,196 INFO L226 Difference]: Without dead ends: 66 [2021-12-21 18:10:09,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:10:09,197 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:09,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 284 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 101 Unchecked, 0.2s Time] [2021-12-21 18:10:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-21 18:10:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2021-12-21 18:10:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 48 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:10:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2021-12-21 18:10:09,199 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 27 [2021-12-21 18:10:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:09,199 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2021-12-21 18:10:09,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2021-12-21 18:10:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 18:10:09,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:09,200 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] [2021-12-21 18:10:09,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:09,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:09,411 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1453003896, now seen corresponding path program 1 times [2021-12-21 18:10:09,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:09,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581344738] [2021-12-21 18:10:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:09,413 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:09,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:09,414 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:09,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-21 18:10:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:09,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:10:09,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:09,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:09,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:09,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-21 18:10:09,987 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-21 18:10:09,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:09,987 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:09,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581344738] [2021-12-21 18:10:09,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581344738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:09,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:09,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-21 18:10:09,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383314808] [2021-12-21 18:10:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:09,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-21 18:10:09,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:09,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 18:10:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:10:09,989 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:10,215 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2021-12-21 18:10:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 18:10:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2021-12-21 18:10:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:10,216 INFO L225 Difference]: With dead ends: 62 [2021-12-21 18:10:10,216 INFO L226 Difference]: Without dead ends: 62 [2021-12-21 18:10:10,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:10:10,217 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:10,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 238 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 124 Unchecked, 0.1s Time] [2021-12-21 18:10:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-21 18:10:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2021-12-21 18:10:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 47 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:10:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2021-12-21 18:10:10,220 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 27 [2021-12-21 18:10:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:10,220 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2021-12-21 18:10:10,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2021-12-21 18:10:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 18:10:10,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:10,221 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] [2021-12-21 18:10:10,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:10,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:10,421 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:10,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2144913277, now seen corresponding path program 1 times [2021-12-21 18:10:10,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:10,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740757014] [2021-12-21 18:10:10,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:10,423 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:10,425 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:10,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-21 18:10:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:10,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-21 18:10:10,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:10,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:10,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:10,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-21 18:10:11,017 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-21 18:10:11,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:11,018 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:11,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740757014] [2021-12-21 18:10:11,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740757014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:11,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:11,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-21 18:10:11,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961047625] [2021-12-21 18:10:11,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:11,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 18:10:11,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 18:10:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:10:11,019 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:11,447 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2021-12-21 18:10:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 18:10:11,448 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2021-12-21 18:10:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:11,451 INFO L225 Difference]: With dead ends: 77 [2021-12-21 18:10:11,451 INFO L226 Difference]: Without dead ends: 77 [2021-12-21 18:10:11,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:10:11,452 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 49 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:11,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 294 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 258 Invalid, 0 Unknown, 151 Unchecked, 0.3s Time] [2021-12-21 18:10:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-21 18:10:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2021-12-21 18:10:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.391304347826087) internal successors, (64), 57 states have internal predecessors, (64), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-12-21 18:10:11,464 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 32 [2021-12-21 18:10:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:11,465 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-12-21 18:10:11,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-12-21 18:10:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 18:10:11,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:11,467 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] [2021-12-21 18:10:11,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:11,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:11,674 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2144913276, now seen corresponding path program 1 times [2021-12-21 18:10:11,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:11,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965390621] [2021-12-21 18:10:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:11,675 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:11,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:11,676 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:11,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-21 18:10:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:11,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-21 18:10:11,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:11,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:12,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:12,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:12,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:10:12,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-21 18:10:12,505 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-21 18:10:12,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:12,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965390621] [2021-12-21 18:10:12,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965390621] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:12,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:12,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-21 18:10:12,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502799849] [2021-12-21 18:10:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:12,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 18:10:12,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 18:10:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-21 18:10:12,507 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:12,888 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2021-12-21 18:10:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 18:10:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2021-12-21 18:10:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:12,889 INFO L225 Difference]: With dead ends: 75 [2021-12-21 18:10:12,889 INFO L226 Difference]: Without dead ends: 75 [2021-12-21 18:10:12,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:10:12,890 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:12,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 267 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 99 Unchecked, 0.3s Time] [2021-12-21 18:10:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-21 18:10:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2021-12-21 18:10:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2021-12-21 18:10:12,893 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 32 [2021-12-21 18:10:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:12,893 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2021-12-21 18:10:12,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2021-12-21 18:10:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 18:10:12,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:12,893 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] [2021-12-21 18:10:12,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:13,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:13,100 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2145015303, now seen corresponding path program 1 times [2021-12-21 18:10:13,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:13,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220021320] [2021-12-21 18:10:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:13,102 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:13,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:13,103 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:13,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-21 18:10:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:13,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:10:13,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:13,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:13,493 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:10:13,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-21 18:10:13,560 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-21 18:10:13,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:13,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:13,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220021320] [2021-12-21 18:10:13,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220021320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:13,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:13,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-21 18:10:13,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746215280] [2021-12-21 18:10:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:13,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 18:10:13,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 18:10:13,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-21 18:10:13,562 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:14,033 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-12-21 18:10:14,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 18:10:14,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2021-12-21 18:10:14,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:14,037 INFO L225 Difference]: With dead ends: 68 [2021-12-21 18:10:14,037 INFO L226 Difference]: Without dead ends: 68 [2021-12-21 18:10:14,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-12-21 18:10:14,038 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:14,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 398 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:10:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-21 18:10:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-12-21 18:10:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-12-21 18:10:14,040 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 32 [2021-12-21 18:10:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:14,040 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-12-21 18:10:14,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-12-21 18:10:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 18:10:14,041 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:14,041 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-21 18:10:14,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-21 18:10:14,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:14,252 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr4REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:14,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1412027647, now seen corresponding path program 1 times [2021-12-21 18:10:14,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:14,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827660662] [2021-12-21 18:10:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:14,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:14,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:14,255 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:14,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-21 18:10:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:14,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-21 18:10:14,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:14,460 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-21 18:10:14,461 INFO L387 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 21 [2021-12-21 18:10:14,522 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:10:14,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2021-12-21 18:10:14,653 INFO L353 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2021-12-21 18:10:14,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 29 [2021-12-21 18:10:15,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:15,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:10:15,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:10:15,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:15,149 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-21 18:10:15,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-21 18:10:15,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-21 18:10:15,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-12-21 18:10:15,775 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 18:10:15,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2021-12-21 18:10:15,846 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-21 18:10:15,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:15,847 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:15,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827660662] [2021-12-21 18:10:15,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827660662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:15,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:15,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-21 18:10:15,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464916376] [2021-12-21 18:10:15,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:15,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 18:10:15,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:15,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 18:10:15,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2021-12-21 18:10:15,848 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:16,467 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2021-12-21 18:10:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 18:10:16,468 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2021-12-21 18:10:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:16,468 INFO L225 Difference]: With dead ends: 70 [2021-12-21 18:10:16,468 INFO L226 Difference]: Without dead ends: 70 [2021-12-21 18:10:16,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2021-12-21 18:10:16,469 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:16,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 352 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 220 Unchecked, 0.3s Time] [2021-12-21 18:10:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-21 18:10:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2021-12-21 18:10:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 57 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2021-12-21 18:10:16,471 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 35 [2021-12-21 18:10:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:16,471 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2021-12-21 18:10:16,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2021-12-21 18:10:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 18:10:16,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:16,472 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-21 18:10:16,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:16,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:16,680 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_list_delErr5REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1412027648, now seen corresponding path program 1 times [2021-12-21 18:10:16,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:16,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249505524] [2021-12-21 18:10:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:16,681 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:16,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:16,683 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:16,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-21 18:10:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:16,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-21 18:10:16,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:16,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:16,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:16,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:10:16,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:10:17,018 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:10:17,018 INFO L387 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-21 18:10:17,030 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:10:17,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:10:17,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 18:10:17,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 18:10:17,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:17,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:17,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:10:17,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:10:17,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:10:17,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:10:17,563 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-21 18:10:17,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-21 18:10:17,602 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-21 18:10:17,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-21 18:10:17,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-21 18:10:17,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-21 18:10:18,528 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:10:18,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2021-12-21 18:10:18,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2021-12-21 18:10:18,639 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-21 18:10:18,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:18,640 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:18,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249505524] [2021-12-21 18:10:18,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249505524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:18,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:18,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-21 18:10:18,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374762310] [2021-12-21 18:10:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:18,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 18:10:18,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:18,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 18:10:18,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2021-12-21 18:10:18,641 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 23 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:19,004 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2021-12-21 18:10:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 18:10:19,005 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2021-12-21 18:10:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:19,006 INFO L225 Difference]: With dead ends: 69 [2021-12-21 18:10:19,006 INFO L226 Difference]: Without dead ends: 69 [2021-12-21 18:10:19,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2021-12-21 18:10:19,006 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:19,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 369 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 273 Unchecked, 0.1s Time] [2021-12-21 18:10:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-21 18:10:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2021-12-21 18:10:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 57 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2021-12-21 18:10:19,008 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 35 [2021-12-21 18:10:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:19,008 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2021-12-21 18:10:19,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2021-12-21 18:10:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:10:19,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:19,009 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] [2021-12-21 18:10:19,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:19,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:19,209 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_list_delErr6REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 823184137, now seen corresponding path program 1 times [2021-12-21 18:10:19,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:19,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732254339] [2021-12-21 18:10:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:19,210 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:19,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:19,217 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:19,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-21 18:10:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:19,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-21 18:10:19,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:19,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:19,436 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:10:19,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:10:19,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 18:10:19,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:19,732 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-21 18:10:19,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:10:19,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-12-21 18:10:20,314 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 18:10:20,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2021-12-21 18:10:20,382 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-21 18:10:20,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:20,382 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:20,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732254339] [2021-12-21 18:10:20,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732254339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:20,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:20,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-12-21 18:10:20,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086776758] [2021-12-21 18:10:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:20,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-21 18:10:20,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:20,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-21 18:10:20,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:10:20,384 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 22 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:21,072 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2021-12-21 18:10:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 18:10:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2021-12-21 18:10:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:21,073 INFO L225 Difference]: With dead ends: 68 [2021-12-21 18:10:21,073 INFO L226 Difference]: Without dead ends: 68 [2021-12-21 18:10:21,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 18:10:21,074 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:21,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 188 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2021-12-21 18:10:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-21 18:10:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-12-21 18:10:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 57 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-12-21 18:10:21,076 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 36 [2021-12-21 18:10:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:21,076 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-12-21 18:10:21,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-12-21 18:10:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:10:21,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:21,077 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] [2021-12-21 18:10:21,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-21 18:10:21,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:21,277 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_list_delErr7REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash 823184138, now seen corresponding path program 1 times [2021-12-21 18:10:21,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:21,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833028665] [2021-12-21 18:10:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:21,278 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:21,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:21,279 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:21,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-21 18:10:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:21,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-21 18:10:21,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:21,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:21,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:21,529 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:10:21,529 INFO L387 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-21 18:10:21,544 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:10:21,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:10:21,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 18:10:21,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 18:10:21,879 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-21 18:10:21,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-12-21 18:10:21,908 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-21 18:10:21,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:10:22,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:10:22,745 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:10:22,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-12-21 18:10:22,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2021-12-21 18:10:22,860 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-21 18:10:22,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:22,860 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:22,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833028665] [2021-12-21 18:10:22,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833028665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:22,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:22,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-21 18:10:22,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32739167] [2021-12-21 18:10:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:22,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-21 18:10:22,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-21 18:10:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-12-21 18:10:22,862 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:23,363 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2021-12-21 18:10:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 18:10:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2021-12-21 18:10:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:23,365 INFO L225 Difference]: With dead ends: 67 [2021-12-21 18:10:23,365 INFO L226 Difference]: Without dead ends: 67 [2021-12-21 18:10:23,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-12-21 18:10:23,365 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:23,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 178 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 232 Unchecked, 0.2s Time] [2021-12-21 18:10:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-21 18:10:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-21 18:10:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 57 states have internal predecessors, (57), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2021-12-21 18:10:23,367 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 36 [2021-12-21 18:10:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:23,367 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2021-12-21 18:10:23,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:10:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2021-12-21 18:10:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 18:10:23,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:23,368 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, 1, 1, 1, 1] [2021-12-21 18:10:23,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-21 18:10:23,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:23,573 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:23,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1922248378, now seen corresponding path program 1 times [2021-12-21 18:10:23,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:23,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907737722] [2021-12-21 18:10:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:23,574 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:23,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:23,575 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:23,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-21 18:10:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:23,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 18:10:23,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:23,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-21 18:10:23,851 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-21 18:10:23,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:23,852 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:23,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907737722] [2021-12-21 18:10:23,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907737722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:23,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:23,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:10:23,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652432435] [2021-12-21 18:10:23,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:23,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 18:10:23,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 18:10:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:10:23,854 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 18:10:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:24,162 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2021-12-21 18:10:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:10:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-21 18:10:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:24,163 INFO L225 Difference]: With dead ends: 70 [2021-12-21 18:10:24,163 INFO L226 Difference]: Without dead ends: 70 [2021-12-21 18:10:24,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-12-21 18:10:24,164 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:24,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:10:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-21 18:10:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2021-12-21 18:10:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 58 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-12-21 18:10:24,179 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 41 [2021-12-21 18:10:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:24,179 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-12-21 18:10:24,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 18:10:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-12-21 18:10:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 18:10:24,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:24,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:24,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:24,394 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:24,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1922248379, now seen corresponding path program 1 times [2021-12-21 18:10:24,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:24,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561751022] [2021-12-21 18:10:24,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:24,396 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:24,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:24,397 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:24,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-21 18:10:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:24,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-21 18:10:24,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:24,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:24,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:10:24,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:10:24,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:10:24,801 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:10:24,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:10:24,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-21 18:10:24,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 18:10:24,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 18:10:25,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:25,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:10:25,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:10:25,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:10:25,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:10:25,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:10:25,362 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-21 18:10:25,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-21 18:10:25,393 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-21 18:10:25,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-21 18:10:25,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-21 18:10:25,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-21 18:10:25,989 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:10:25,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2021-12-21 18:10:25,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2021-12-21 18:10:26,180 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-21 18:10:26,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:10:26,180 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:26,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561751022] [2021-12-21 18:10:26,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561751022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:10:26,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:10:26,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-21 18:10:26,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474853361] [2021-12-21 18:10:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:10:26,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-21 18:10:26,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:26,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-21 18:10:26,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-12-21 18:10:26,182 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:10:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:26,491 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2021-12-21 18:10:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-21 18:10:26,496 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2021-12-21 18:10:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:26,497 INFO L225 Difference]: With dead ends: 76 [2021-12-21 18:10:26,497 INFO L226 Difference]: Without dead ends: 76 [2021-12-21 18:10:26,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-12-21 18:10:26,498 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:26,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 363 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 257 Unchecked, 0.2s Time] [2021-12-21 18:10:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-21 18:10:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2021-12-21 18:10:26,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 58 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:10:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2021-12-21 18:10:26,500 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 41 [2021-12-21 18:10:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:26,500 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2021-12-21 18:10:26,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-21 18:10:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2021-12-21 18:10:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:10:26,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:26,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:26,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:26,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:26,710 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_list_delErr0REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:26,710 INFO L85 PathProgramCache]: Analyzing trace with hash -291334128, now seen corresponding path program 1 times [2021-12-21 18:10:26,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:26,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117405679] [2021-12-21 18:10:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:26,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:26,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:26,712 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:26,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-21 18:10:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:26,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 18:10:26,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:27,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-21 18:10:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:10:27,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:10:27,167 INFO L353 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2021-12-21 18:10:27,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2021-12-21 18:10:27,193 INFO L353 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-21 18:10:27,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2021-12-21 18:10:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:10:27,286 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:27,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117405679] [2021-12-21 18:10:27,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117405679] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:10:27,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:10:27,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2021-12-21 18:10:27,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096665981] [2021-12-21 18:10:27,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:10:27,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-21 18:10:27,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:27,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 18:10:27,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:10:27,288 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 18:10:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:27,958 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2021-12-21 18:10:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 18:10:27,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-12-21 18:10:27,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:27,959 INFO L225 Difference]: With dead ends: 75 [2021-12-21 18:10:27,959 INFO L226 Difference]: Without dead ends: 75 [2021-12-21 18:10:27,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-12-21 18:10:27,960 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 78 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:27,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 239 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 18:10:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-21 18:10:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2021-12-21 18:10:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 61 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 18:10:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-12-21 18:10:27,962 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 46 [2021-12-21 18:10:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:27,963 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-12-21 18:10:27,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 18:10:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-12-21 18:10:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:10:27,963 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:27,963 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:28,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:28,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:28,171 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_list_delErr1REQUIRES_VIOLATION === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:28,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash -291334127, now seen corresponding path program 1 times [2021-12-21 18:10:28,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:28,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107117699] [2021-12-21 18:10:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:28,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:28,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:28,174 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:28,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-21 18:10:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:10:28,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:10:28,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:10:28,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-12-21 18:10:28,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2021-12-21 18:10:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:10:29,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:10:29,906 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:10:29,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2021-12-21 18:10:32,649 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:10:32,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2021-12-21 18:10:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:10:35,286 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:10:35,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107117699] [2021-12-21 18:10:35,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107117699] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:10:35,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:10:35,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2021-12-21 18:10:35,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984113108] [2021-12-21 18:10:35,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:10:35,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-21 18:10:35,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:10:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 18:10:35,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2021-12-21 18:10:35,287 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 18:10:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:10:38,921 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2021-12-21 18:10:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 18:10:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2021-12-21 18:10:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:10:38,924 INFO L225 Difference]: With dead ends: 78 [2021-12-21 18:10:38,925 INFO L226 Difference]: Without dead ends: 78 [2021-12-21 18:10:38,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2021-12-21 18:10:38,925 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 83 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-21 18:10:38,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 385 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 390 Invalid, 0 Unknown, 157 Unchecked, 1.8s Time] [2021-12-21 18:10:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-21 18:10:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2021-12-21 18:10:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 62 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 18:10:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2021-12-21 18:10:38,928 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 46 [2021-12-21 18:10:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:10:38,928 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2021-12-21 18:10:38,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-21 18:10:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2021-12-21 18:10:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:10:38,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:10:38,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:10:38,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:39,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:39,130 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION (and 21 more)] === [2021-12-21 18:10:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:10:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash -291436154, now seen corresponding path program 1 times [2021-12-21 18:10:39,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:10:39,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330753621] [2021-12-21 18:10:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:10:39,131 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:10:39,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:10:39,132 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:10:39,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-21 18:10:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:10:39,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 18:10:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:10:39,595 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-21 18:10:39,596 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 18:10:39,597 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (24 of 25 remaining) [2021-12-21 18:10:39,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr0REQUIRES_VIOLATION (23 of 25 remaining) [2021-12-21 18:10:39,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr1REQUIRES_VIOLATION (22 of 25 remaining) [2021-12-21 18:10:39,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (21 of 25 remaining) [2021-12-21 18:10:39,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (20 of 25 remaining) [2021-12-21 18:10:39,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (19 of 25 remaining) [2021-12-21 18:10:39,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (18 of 25 remaining) [2021-12-21 18:10:39,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (17 of 25 remaining) [2021-12-21 18:10:39,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (16 of 25 remaining) [2021-12-21 18:10:39,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr0REQUIRES_VIOLATION (15 of 25 remaining) [2021-12-21 18:10:39,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr1REQUIRES_VIOLATION (14 of 25 remaining) [2021-12-21 18:10:39,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr2REQUIRES_VIOLATION (13 of 25 remaining) [2021-12-21 18:10:39,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr3REQUIRES_VIOLATION (12 of 25 remaining) [2021-12-21 18:10:39,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr4REQUIRES_VIOLATION (11 of 25 remaining) [2021-12-21 18:10:39,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr5REQUIRES_VIOLATION (10 of 25 remaining) [2021-12-21 18:10:39,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr6REQUIRES_VIOLATION (9 of 25 remaining) [2021-12-21 18:10:39,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr7REQUIRES_VIOLATION (8 of 25 remaining) [2021-12-21 18:10:39,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATION (7 of 25 remaining) [2021-12-21 18:10:39,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATION (6 of 25 remaining) [2021-12-21 18:10:39,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATION (5 of 25 remaining) [2021-12-21 18:10:39,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATION (4 of 25 remaining) [2021-12-21 18:10:39,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATION (3 of 25 remaining) [2021-12-21 18:10:39,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATION (2 of 25 remaining) [2021-12-21 18:10:39,601 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATION (1 of 25 remaining) [2021-12-21 18:10:39,602 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATION (0 of 25 remaining) [2021-12-21 18:10:39,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-21 18:10:39,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:10:39,805 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-21 18:10:39,807 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 18:10:39,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 06:10:39 BoogieIcfgContainer [2021-12-21 18:10:39,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 18:10:39,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 18:10:39,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 18:10:39,846 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 18:10:39,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:09:52" (3/4) ... [2021-12-21 18:10:39,859 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 18:10:39,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 18:10:39,859 INFO L158 Benchmark]: Toolchain (without parser) took 48205.86ms. Allocated memory was 52.4MB in the beginning and 111.1MB in the end (delta: 58.7MB). Free memory was 28.2MB in the beginning and 70.1MB in the end (delta: -41.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2021-12-21 18:10:39,860 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 52.4MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:10:39,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.03ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.0MB in the beginning and 39.0MB in the end (delta: -11.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2021-12-21 18:10:39,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.56ms. Allocated memory is still 62.9MB. Free memory was 38.9MB in the beginning and 36.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 18:10:39,860 INFO L158 Benchmark]: Boogie Preprocessor took 40.63ms. Allocated memory is still 62.9MB. Free memory was 36.6MB in the beginning and 34.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:10:39,860 INFO L158 Benchmark]: RCFGBuilder took 543.46ms. Allocated memory is still 62.9MB. Free memory was 34.7MB in the beginning and 29.8MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 18:10:39,861 INFO L158 Benchmark]: TraceAbstraction took 47071.39ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 29.3MB in the beginning and 70.1MB in the end (delta: -40.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2021-12-21 18:10:39,861 INFO L158 Benchmark]: Witness Printer took 13.02ms. Allocated memory is still 111.1MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:10:39,862 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.23ms. Allocated memory is still 52.4MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.03ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.0MB in the beginning and 39.0MB in the end (delta: -11.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.56ms. Allocated memory is still 62.9MB. Free memory was 38.9MB in the beginning and 36.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.63ms. Allocated memory is still 62.9MB. Free memory was 36.6MB in the beginning and 34.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 543.46ms. Allocated memory is still 62.9MB. Free memory was 34.7MB in the beginning and 29.8MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 47071.39ms. Allocated memory was 62.9MB in the beginning and 111.1MB in the end (delta: 48.2MB). Free memory was 29.3MB in the beginning and 70.1MB in the end (delta: -40.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 13.02ms. Allocated memory is still 111.1MB. Free memory is still 70.1MB. 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: 779]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 779. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L780] CALL entry_point() [L775] struct ldv_list_head list_14 = { &(list_14), &(list_14) }; [L776] CALL alloc_14(&list_14) [L762] CALL, EXPR ldv_malloc(sizeof(struct A14)) VAL [\old(size)=12, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L762] RET, EXPR ldv_malloc(sizeof(struct A14)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct A14))={2:0}, list={-2147483647:0}, list={-2147483647:0}] [L762] struct A14 *p = (struct A14 *)ldv_malloc(sizeof(struct A14)); [L763] COND TRUE \read(*p) VAL [ldv_global_msg_list={1:0}, list={-2147483647:0}, list={-2147483647:0}, p={2:0}] [L764] CALL ldv_list_add(&p->list, list) VAL [head={-2147483647:0}, ldv_global_msg_list={1:0}, new={2:4}] [L559] EXPR head->next VAL [head={-2147483647:0}, head={-2147483647:0}, head->next={-2147483647:0}, ldv_global_msg_list={1:0}, new={2:4}, new={2:4}] [L559] CALL __ldv_list_add(new, head, head->next) VAL [ldv_global_msg_list={1:0}, new={2:4}, next={-2147483647:0}, prev={-2147483647:0}] [L547] next->prev = new VAL [ldv_global_msg_list={1:0}, new={2:4}, new={2:4}, next={-2147483647:0}, next={-2147483647:0}, prev={-2147483647:0}, prev={-2147483647:0}] [L548] new->next = next VAL [ldv_global_msg_list={1:0}, new={2:4}, new={2:4}, next={-2147483647:0}, next={-2147483647:0}, prev={-2147483647:0}, prev={-2147483647:0}] [L549] new->prev = prev VAL [ldv_global_msg_list={1:0}, new={2:4}, new={2:4}, next={-2147483647:0}, next={-2147483647:0}, prev={-2147483647:0}, prev={-2147483647:0}] [L550] prev->next = new VAL [ldv_global_msg_list={1:0}, new={2:4}, new={2:4}, next={-2147483647:0}, next={-2147483647:0}, prev={-2147483647:0}, prev={-2147483647:0}] [L559] RET __ldv_list_add(new, head, head->next) VAL [head={-2147483647:0}, head={-2147483647:0}, head->next={-2147483647:0}, ldv_global_msg_list={1:0}, new={2:4}, new={2:4}] [L764] RET ldv_list_add(&p->list, list) VAL [ldv_global_msg_list={1:0}, list={-2147483647:0}, list={-2147483647:0}, p={2:0}] [L776] RET alloc_14(&list_14) [L777] CALL free_unsafe_14(&list_14) [L768] struct A14 *p; [L769] struct A14 *n; VAL [ldv_global_msg_list={1:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] EXPR (plist)->next VAL [(plist)->next={2:4}, ldv_global_msg_list={1:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] const typeof( ((typeof(*p) *)0)->list ) *__mptr = ((plist)->next); [L770] p = ({ const typeof( ((typeof(*p) *)0)->list ) *__mptr = ((plist)->next); (typeof(*p) *)( (char *)__mptr - ((size_t) &((typeof(*p) *)0)->list) );}) VAL [__mptr={2:4}, ldv_global_msg_list={1:0}, p={2:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] EXPR (p)->list.next VAL [(p)->list.next={-2147483647:0}, __mptr={2:4}, ldv_global_msg_list={1:0}, p={2:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] const typeof( ((typeof(*(p)) *)0)->list ) *__mptr = ((p)->list.next); [L770] n = ({ const typeof( ((typeof(*(p)) *)0)->list ) *__mptr = ((p)->list.next); (typeof(*(p)) *)( (char *)__mptr - ((size_t) &((typeof(*(p)) *)0)->list) );}) VAL [__mptr={-2147483647:0}, __mptr={2:4}, ldv_global_msg_list={1:0}, n={-2147483647:-4}, p={2:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] COND TRUE &p->list != (plist) VAL [__mptr={2:4}, __mptr={-2147483647:0}, ldv_global_msg_list={1:0}, n={-2147483647:-4}, p={2:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L771] CALL ldv_list_del(&p->list) VAL [ldv_global_msg_list={1:0}] [L567] EXPR entry->prev VAL [entry={2:4}, entry={2:4}, entry->prev={-2147483647:0}, ldv_global_msg_list={1:0}] [L567] EXPR entry->next VAL [entry={2:4}, entry={2:4}, entry->next={-2147483647:0}, entry->prev={-2147483647:0}, ldv_global_msg_list={1:0}] [L567] CALL __ldv_list_del(entry->prev, entry->next) [L554] next->prev = prev VAL [ldv_global_msg_list={1:0}, next={-2147483647:0}, next={-2147483647:0}, prev={-2147483647:0}, prev={-2147483647:0}] [L555] prev->next = next VAL [ldv_global_msg_list={1:0}, next={-2147483647:0}, next={-2147483647:0}, prev={-2147483647:0}, prev={-2147483647:0}] [L567] RET __ldv_list_del(entry->prev, entry->next) [L771] RET ldv_list_del(&p->list) VAL [__mptr={2:4}, __mptr={-2147483647:0}, ldv_global_msg_list={1:0}, n={-2147483647:-4}, p={2:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] p = n VAL [__mptr={-2147483647:0}, __mptr={2:4}, ldv_global_msg_list={1:0}, n={-2147483647:-4}, p={-2147483647:-4}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] EXPR (n)->list.next VAL [(n)->list.next={-2147483647:0}, __mptr={-2147483647:0}, __mptr={2:4}, ldv_global_msg_list={1:0}, n={-2147483647:-4}, p={-2147483647:-4}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] const typeof( ((typeof(*(n)) *)0)->list ) *__mptr = ((n)->list.next); [L770] n = ({ const typeof( ((typeof(*(n)) *)0)->list ) *__mptr = ((n)->list.next); (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) );}) VAL [__mptr={-2147483647:0}, __mptr={-2147483647:0}, __mptr={2:4}, ldv_global_msg_list={1:0}, n={-2147483647:-4}, p={-2147483647:-4}, plist={-2147483647:0}, plist={-2147483647:0}] [L770] COND FALSE !(&p->list != (plist)) VAL [__mptr={2:4}, __mptr={-2147483647:0}, __mptr={-2147483647:0}, ldv_global_msg_list={1:0}, n={-2147483647:-4}, p={-2147483647:-4}, plist={-2147483647:0}, plist={-2147483647:0}] [L777] RET free_unsafe_14(&list_14) [L775] struct ldv_list_head list_14 = { &(list_14), &(list_14) }; VAL [ldv_global_msg_list={1:0}] [L780] RET entry_point() - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 72 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 47.0s, OverallIterations: 32, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1302 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1267 mSDsluCounter, 7775 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2316 IncrementalHoareTripleChecker+Unchecked, 6330 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5083 IncrementalHoareTripleChecker+Invalid, 7572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 1445 mSDtfsCounter, 5083 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 492 SyntacticMatches, 10 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=7, InterpolantAutomatonStates: 386, 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, 31 MinimizatonAttempts, 207 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 794 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 807 ConstructedInterpolants, 212 QuantifiedInterpolants, 11046 SizeOfPredicates, 435 NumberOfNonLiveVariables, 4333 ConjunctsInSsa, 855 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 0/16 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-21 18:10:39,912 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample