./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.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/memsafety-ext/skiplist_2lvl.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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:05:37,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:05:37,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:05:37,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:05:37,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:05:37,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:05:37,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:05:37,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:05:37,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:05:37,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:05:37,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:05:37,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:05:37,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:05:37,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:05:37,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:05:37,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:05:37,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:05:37,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:05:37,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:05:37,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:05:37,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:05:37,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:05:37,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:05:37,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:05:37,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:05:37,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:05:37,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:05:37,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:05:37,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:05:37,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:05:37,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:05:37,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:05:37,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:05:37,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:05:37,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:05:37,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:05:37,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:05:37,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:05:37,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:05:37,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:05:37,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:05:37,735 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:05:37,764 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:05:37,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:05:37,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:05:37,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:05:37,766 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:05:37,766 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:05:37,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:05:37,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:05:37,767 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:05:37,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:05:37,768 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:05:37,768 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:05:37,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:05:37,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:05:37,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:05:37,769 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:05:37,769 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:05:37,769 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:05:37,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:05:37,769 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:05:37,770 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:05:37,770 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:05:37,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:05:37,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:05:37,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:05:37,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:05:37,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:05:37,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:05:37,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:05:37,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:05:37,771 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:05:37,772 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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2021-12-21 18:05:37,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:05:38,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:05:38,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:05:38,026 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:05:38,026 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:05:38,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-21 18:05:38,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1917b8ef/a366b54000cb4715ad8c9f4b892686db/FLAG6452e0a28 [2021-12-21 18:05:38,588 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:05:38,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-21 18:05:38,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1917b8ef/a366b54000cb4715ad8c9f4b892686db/FLAG6452e0a28 [2021-12-21 18:05:39,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1917b8ef/a366b54000cb4715ad8c9f4b892686db [2021-12-21 18:05:39,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:05:39,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:05:39,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:05:39,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:05:39,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:05:39,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187a6180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39, skipping insertion in model container [2021-12-21 18:05:39,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:05:39,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:05:39,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:05:39,362 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:05:39,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:05:39,455 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:05:39,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39 WrapperNode [2021-12-21 18:05:39,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:05:39,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:05:39,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:05:39,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:05:39,465 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:05:39" (1/1) ... [2021-12-21 18:05:39,492 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:05:39" (1/1) ... [2021-12-21 18:05:39,518 INFO L137 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2021-12-21 18:05:39,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:05:39,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:05:39,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:05:39,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:05:39,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:05:39,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:05:39,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:05:39,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:05:39,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (1/1) ... [2021-12-21 18:05:39,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:05:39,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:05:39,578 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:05:39,579 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:05:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:05:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:05:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:05:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:05:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:05:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 18:05:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:05:39,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:05:39,751 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:05:39,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:05:40,193 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:05:40,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:05:40,199 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 18:05:40,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:05:40 BoogieIcfgContainer [2021-12-21 18:05:40,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:05:40,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:05:40,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:05:40,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:05:40,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:05:39" (1/3) ... [2021-12-21 18:05:40,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c07ec07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:05:40, skipping insertion in model container [2021-12-21 18:05:40,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:05:39" (2/3) ... [2021-12-21 18:05:40,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c07ec07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:05:40, skipping insertion in model container [2021-12-21 18:05:40,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:05:40" (3/3) ... [2021-12-21 18:05:40,207 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2021-12-21 18:05:40,211 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:05:40,211 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-21 18:05:40,245 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:05:40,251 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:05:40,251 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-21 18:05:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 18:05:40,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:40,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 18:05:40,269 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-21 18:05:40,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:40,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220797509] [2021-12-21 18:05:40,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:40,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:40,443 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:05:40,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:40,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220797509] [2021-12-21 18:05:40,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220797509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:40,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:40,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:05:40,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420128514] [2021-12-21 18:05:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:40,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:05:40,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:05:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:05:40,480 INFO L87 Difference]: Start difference. First operand has 133 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:40,657 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2021-12-21 18:05:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:05:40,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-21 18:05:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:40,670 INFO L225 Difference]: With dead ends: 156 [2021-12-21 18:05:40,671 INFO L226 Difference]: Without dead ends: 154 [2021-12-21 18:05:40,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:05:40,677 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 122 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:40,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-21 18:05:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 124. [2021-12-21 18:05:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9696969696969697) internal successors, (130), 123 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2021-12-21 18:05:40,712 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2021-12-21 18:05:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:40,713 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2021-12-21 18:05:40,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2021-12-21 18:05:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 18:05:40,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:40,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 18:05:40,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 18:05:40,714 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-21 18:05:40,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:40,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938535067] [2021-12-21 18:05:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:40,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:40,758 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:05:40,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:40,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938535067] [2021-12-21 18:05:40,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938535067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:40,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:40,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:05:40,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494258889] [2021-12-21 18:05:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:40,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:05:40,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:05:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:05:40,763 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:40,835 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-12-21 18:05:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:05:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-21 18:05:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:40,837 INFO L225 Difference]: With dead ends: 117 [2021-12-21 18:05:40,837 INFO L226 Difference]: Without dead ends: 117 [2021-12-21 18:05:40,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:05:40,839 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:40,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 69 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-21 18:05:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-12-21 18:05:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 116 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2021-12-21 18:05:40,847 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 3 [2021-12-21 18:05:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:40,848 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2021-12-21 18:05:40,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2021-12-21 18:05:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:05:40,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:40,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:40,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 18:05:40,849 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606480, now seen corresponding path program 1 times [2021-12-21 18:05:40,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:40,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053743265] [2021-12-21 18:05:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:40,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:40,930 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:05:40,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:40,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053743265] [2021-12-21 18:05:40,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053743265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:40,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:40,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:05:40,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333483354] [2021-12-21 18:05:40,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:40,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:05:40,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:05:40,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:05:40,937 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:41,083 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-12-21 18:05:41,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:05:41,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-21 18:05:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:41,088 INFO L225 Difference]: With dead ends: 116 [2021-12-21 18:05:41,088 INFO L226 Difference]: Without dead ends: 116 [2021-12-21 18:05:41,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:05:41,094 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:41,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 294 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-21 18:05:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-21 18:05:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 115 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2021-12-21 18:05:41,101 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 10 [2021-12-21 18:05:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:41,101 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2021-12-21 18:05:41,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2021-12-21 18:05:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:05:41,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:41,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:41,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 18:05:41,103 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606481, now seen corresponding path program 1 times [2021-12-21 18:05:41,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:41,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149293362] [2021-12-21 18:05:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:41,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:41,250 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:05:41,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:41,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149293362] [2021-12-21 18:05:41,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149293362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:41,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:41,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:05:41,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438833776] [2021-12-21 18:05:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:41,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:05:41,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:41,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:05:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:05:41,254 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:41,449 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-12-21 18:05:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:05:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-21 18:05:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:41,450 INFO L225 Difference]: With dead ends: 115 [2021-12-21 18:05:41,450 INFO L226 Difference]: Without dead ends: 115 [2021-12-21 18:05:41,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:05:41,451 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 10 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:41,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 283 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:05:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-21 18:05:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-12-21 18:05:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8333333333333333) internal successors, (121), 114 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2021-12-21 18:05:41,457 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 10 [2021-12-21 18:05:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:41,458 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2021-12-21 18:05:41,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2021-12-21 18:05:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:05:41,459 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:41,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:41,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 18:05:41,459 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-12-21 18:05:41,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:41,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346978373] [2021-12-21 18:05:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:41,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:41,504 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:05:41,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:41,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346978373] [2021-12-21 18:05:41,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346978373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:41,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:41,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:05:41,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006257980] [2021-12-21 18:05:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:41,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:05:41,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:05:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:05:41,507 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:41,598 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-12-21 18:05:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:05:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-21 18:05:41,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:41,601 INFO L225 Difference]: With dead ends: 114 [2021-12-21 18:05:41,601 INFO L226 Difference]: Without dead ends: 114 [2021-12-21 18:05:41,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:05:41,605 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:41,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 374 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-21 18:05:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-12-21 18:05:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 113 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2021-12-21 18:05:41,613 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 11 [2021-12-21 18:05:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:41,613 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2021-12-21 18:05:41,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2021-12-21 18:05:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:05:41,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:41,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:41,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 18:05:41,614 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-12-21 18:05:41,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:41,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949016195] [2021-12-21 18:05:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:41,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:05:41,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:41,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949016195] [2021-12-21 18:05:41,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949016195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:41,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:41,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:05:41,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213745383] [2021-12-21 18:05:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:41,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:05:41,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:05:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:05:41,752 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:42,004 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2021-12-21 18:05:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:05:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-21 18:05:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:42,005 INFO L225 Difference]: With dead ends: 113 [2021-12-21 18:05:42,005 INFO L226 Difference]: Without dead ends: 113 [2021-12-21 18:05:42,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:05:42,006 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:42,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 410 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:05:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-21 18:05:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-12-21 18:05:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.803030303030303) internal successors, (119), 112 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2021-12-21 18:05:42,011 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 11 [2021-12-21 18:05:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:42,011 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2021-12-21 18:05:42,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2021-12-21 18:05:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:05:42,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:42,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:42,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 18:05:42,013 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:42,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash -266592339, now seen corresponding path program 1 times [2021-12-21 18:05:42,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:42,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427471439] [2021-12-21 18:05:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:42,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:42,155 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:05:42,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:42,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427471439] [2021-12-21 18:05:42,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427471439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:42,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:42,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:05:42,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732915843] [2021-12-21 18:05:42,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:42,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:05:42,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:05:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:05:42,156 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:42,396 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2021-12-21 18:05:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:05:42,396 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 18:05:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:42,397 INFO L225 Difference]: With dead ends: 112 [2021-12-21 18:05:42,397 INFO L226 Difference]: Without dead ends: 112 [2021-12-21 18:05:42,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:05:42,398 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:42,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 578 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:05:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-21 18:05:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-12-21 18:05:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 111 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2021-12-21 18:05:42,402 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 15 [2021-12-21 18:05:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:42,402 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2021-12-21 18:05:42,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2021-12-21 18:05:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:05:42,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:42,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:42,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 18:05:42,403 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash -266592338, now seen corresponding path program 1 times [2021-12-21 18:05:42,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:42,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222370731] [2021-12-21 18:05:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:42,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:42,633 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:05:42,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:42,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222370731] [2021-12-21 18:05:42,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222370731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:42,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:42,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:05:42,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548826860] [2021-12-21 18:05:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:42,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:05:42,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:05:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:05:42,636 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:42,810 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-21 18:05:42,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:05:42,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 18:05:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:42,811 INFO L225 Difference]: With dead ends: 111 [2021-12-21 18:05:42,811 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 18:05:42,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:05:42,812 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 20 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:42,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 18:05:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-21 18:05:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2021-12-21 18:05:42,816 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 15 [2021-12-21 18:05:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:42,816 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2021-12-21 18:05:42,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2021-12-21 18:05:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 18:05:42,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:42,817 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:05:42,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 18:05:42,817 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash 325572089, now seen corresponding path program 1 times [2021-12-21 18:05:42,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:42,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590910773] [2021-12-21 18:05:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:42,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:42,859 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:05:42,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:42,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590910773] [2021-12-21 18:05:42,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590910773] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:42,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:42,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:05:42,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691873572] [2021-12-21 18:05:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:42,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:05:42,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:05:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:05:42,869 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:42,954 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-12-21 18:05:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:05:42,955 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-21 18:05:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:42,956 INFO L225 Difference]: With dead ends: 110 [2021-12-21 18:05:42,956 INFO L226 Difference]: Without dead ends: 110 [2021-12-21 18:05:42,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:05:42,962 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 5 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:42,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 363 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-21 18:05:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-21 18:05:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.7575757575757576) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2021-12-21 18:05:42,969 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 16 [2021-12-21 18:05:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:42,969 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2021-12-21 18:05:42,970 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2021-12-21 18:05:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 18:05:42,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:42,971 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:05:42,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 18:05:42,972 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash 325572090, now seen corresponding path program 1 times [2021-12-21 18:05:42,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:42,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145915976] [2021-12-21 18:05:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:42,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:43,131 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:05:43,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:43,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145915976] [2021-12-21 18:05:43,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145915976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:43,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:43,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:05:43,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197544009] [2021-12-21 18:05:43,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:43,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:05:43,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:43,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:05:43,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:05:43,133 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:43,317 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2021-12-21 18:05:43,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:05:43,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-21 18:05:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:43,318 INFO L225 Difference]: With dead ends: 109 [2021-12-21 18:05:43,318 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 18:05:43,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:05:43,319 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:43,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 473 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 18:05:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-21 18:05:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2021-12-21 18:05:43,322 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 16 [2021-12-21 18:05:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:43,322 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2021-12-21 18:05:43,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2021-12-21 18:05:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 18:05:43,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:43,323 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] [2021-12-21 18:05:43,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 18:05:43,323 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash 379588598, now seen corresponding path program 1 times [2021-12-21 18:05:43,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:43,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193290733] [2021-12-21 18:05:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:43,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:43,377 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:05:43,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:43,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193290733] [2021-12-21 18:05:43,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193290733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:43,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:43,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:05:43,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447867640] [2021-12-21 18:05:43,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:43,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:05:43,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:43,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:05:43,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:05:43,380 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:43,529 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2021-12-21 18:05:43,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:05:43,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-21 18:05:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:43,531 INFO L225 Difference]: With dead ends: 170 [2021-12-21 18:05:43,531 INFO L226 Difference]: Without dead ends: 170 [2021-12-21 18:05:43,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:05:43,532 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 362 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:43,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 155 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-21 18:05:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 107. [2021-12-21 18:05:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 106 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-12-21 18:05:43,538 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 21 [2021-12-21 18:05:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:43,540 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-12-21 18:05:43,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-12-21 18:05:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 18:05:43,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:43,543 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] [2021-12-21 18:05:43,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 18:05:43,544 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash 379588599, now seen corresponding path program 1 times [2021-12-21 18:05:43,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:43,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043801964] [2021-12-21 18:05:43,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:43,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:43,654 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:05:43,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:43,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043801964] [2021-12-21 18:05:43,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043801964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:43,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:43,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:05:43,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383310390] [2021-12-21 18:05:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:43,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:05:43,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:05:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:05:43,656 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:43,820 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2021-12-21 18:05:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:05:43,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-21 18:05:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:43,822 INFO L225 Difference]: With dead ends: 141 [2021-12-21 18:05:43,822 INFO L226 Difference]: Without dead ends: 141 [2021-12-21 18:05:43,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:05:43,822 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 382 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:43,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 117 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-21 18:05:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2021-12-21 18:05:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2021-12-21 18:05:43,826 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 21 [2021-12-21 18:05:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:43,826 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2021-12-21 18:05:43,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2021-12-21 18:05:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:05:43,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:43,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:43,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 18:05:43,827 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1117654205, now seen corresponding path program 1 times [2021-12-21 18:05:43,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:43,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579453896] [2021-12-21 18:05:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:43,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:43,872 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:05:43,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:43,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579453896] [2021-12-21 18:05:43,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579453896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:43,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:43,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:05:43,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760897283] [2021-12-21 18:05:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:43,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:05:43,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:05:43,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:05:43,875 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:44,007 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2021-12-21 18:05:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:05:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-21 18:05:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:44,008 INFO L225 Difference]: With dead ends: 126 [2021-12-21 18:05:44,008 INFO L226 Difference]: Without dead ends: 126 [2021-12-21 18:05:44,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:05:44,009 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 297 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:44,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 130 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-21 18:05:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2021-12-21 18:05:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.626865671641791) internal successors, (109), 101 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-12-21 18:05:44,013 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 22 [2021-12-21 18:05:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:44,013 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-12-21 18:05:44,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-12-21 18:05:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:05:44,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:44,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:44,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 18:05:44,015 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1117654204, now seen corresponding path program 1 times [2021-12-21 18:05:44,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:44,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222661513] [2021-12-21 18:05:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:44,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:05:44,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:44,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222661513] [2021-12-21 18:05:44,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222661513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:44,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:44,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:05:44,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639532221] [2021-12-21 18:05:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:44,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:05:44,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:05:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:05:44,139 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:44,269 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2021-12-21 18:05:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:05:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-21 18:05:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:44,270 INFO L225 Difference]: With dead ends: 97 [2021-12-21 18:05:44,270 INFO L226 Difference]: Without dead ends: 97 [2021-12-21 18:05:44,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:05:44,270 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 372 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:44,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 90 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-21 18:05:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-12-21 18:05:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.537313432835821) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2021-12-21 18:05:44,273 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 22 [2021-12-21 18:05:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:44,273 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2021-12-21 18:05:44,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2021-12-21 18:05:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 18:05:44,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:44,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:44,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 18:05:44,274 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:44,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:44,274 INFO L85 PathProgramCache]: Analyzing trace with hash -287576677, now seen corresponding path program 1 times [2021-12-21 18:05:44,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:44,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483442651] [2021-12-21 18:05:44,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:44,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:44,577 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:05:44,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:44,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483442651] [2021-12-21 18:05:44,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483442651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:44,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:44,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-21 18:05:44,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122712908] [2021-12-21 18:05:44,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:44,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 18:05:44,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:44,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 18:05:44,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-12-21 18:05:44,578 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:45,236 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2021-12-21 18:05:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:05:45,237 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 18:05:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:45,238 INFO L225 Difference]: With dead ends: 165 [2021-12-21 18:05:45,238 INFO L226 Difference]: Without dead ends: 165 [2021-12-21 18:05:45,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 18:05:45,239 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 413 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:45,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 774 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:05:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-21 18:05:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2021-12-21 18:05:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-12-21 18:05:45,241 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 23 [2021-12-21 18:05:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:45,242 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-12-21 18:05:45,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-12-21 18:05:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 18:05:45,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:45,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:45,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 18:05:45,243 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:45,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash -287576676, now seen corresponding path program 1 times [2021-12-21 18:05:45,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:45,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442649700] [2021-12-21 18:05:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:45,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:45,643 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:05:45,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:45,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442649700] [2021-12-21 18:05:45,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442649700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:45,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:45,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-21 18:05:45,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412565926] [2021-12-21 18:05:45,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:45,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 18:05:45,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 18:05:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:05:45,645 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:46,485 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2021-12-21 18:05:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:05:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 18:05:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:46,487 INFO L225 Difference]: With dead ends: 211 [2021-12-21 18:05:46,487 INFO L226 Difference]: Without dead ends: 211 [2021-12-21 18:05:46,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2021-12-21 18:05:46,488 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 628 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:46,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 811 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:05:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-21 18:05:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2021-12-21 18:05:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2021-12-21 18:05:46,491 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 23 [2021-12-21 18:05:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:46,492 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2021-12-21 18:05:46,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2021-12-21 18:05:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 18:05:46,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:46,492 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:05:46,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 18:05:46,493 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1449815588, now seen corresponding path program 1 times [2021-12-21 18:05:46,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:46,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005674720] [2021-12-21 18:05:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:46,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:46,552 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:05:46,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:46,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005674720] [2021-12-21 18:05:46,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005674720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:46,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:46,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:05:46,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557954572] [2021-12-21 18:05:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:46,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:05:46,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:05:46,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:05:46,556 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:46,609 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2021-12-21 18:05:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:05:46,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-21 18:05:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:46,611 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:05:46,611 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:05:46,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:05:46,612 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 258 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:46,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 146 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:05:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:05:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-21 18:05:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2021-12-21 18:05:46,618 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 25 [2021-12-21 18:05:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:46,619 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2021-12-21 18:05:46,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2021-12-21 18:05:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 18:05:46,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:46,621 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:05:46,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 18:05:46,621 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:46,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:46,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1702259996, now seen corresponding path program 1 times [2021-12-21 18:05:46,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:46,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634278326] [2021-12-21 18:05:46,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:46,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:46,855 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:05:46,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:46,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634278326] [2021-12-21 18:05:46,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634278326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:46,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:46,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-21 18:05:46,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486028197] [2021-12-21 18:05:46,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:46,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 18:05:46,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 18:05:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:05:46,858 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:47,360 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2021-12-21 18:05:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:05:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-21 18:05:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:47,362 INFO L225 Difference]: With dead ends: 166 [2021-12-21 18:05:47,362 INFO L226 Difference]: Without dead ends: 166 [2021-12-21 18:05:47,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2021-12-21 18:05:47,363 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 320 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:47,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 705 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:05:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-21 18:05:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-12-21 18:05:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 127 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2021-12-21 18:05:47,367 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2021-12-21 18:05:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:47,367 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2021-12-21 18:05:47,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2021-12-21 18:05:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 18:05:47,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:47,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] [2021-12-21 18:05:47,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 18:05:47,369 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1702259995, now seen corresponding path program 1 times [2021-12-21 18:05:47,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:47,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592133883] [2021-12-21 18:05:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:47,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:47,707 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:05:47,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:47,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592133883] [2021-12-21 18:05:47,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592133883] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:47,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:47,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-21 18:05:47,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820435120] [2021-12-21 18:05:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:47,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 18:05:47,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 18:05:47,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-12-21 18:05:47,709 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:48,417 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2021-12-21 18:05:48,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:05:48,417 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-21 18:05:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:48,418 INFO L225 Difference]: With dead ends: 166 [2021-12-21 18:05:48,418 INFO L226 Difference]: Without dead ends: 166 [2021-12-21 18:05:48,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 18:05:48,419 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 272 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:48,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 629 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:05:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-21 18:05:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-12-21 18:05:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 127 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2021-12-21 18:05:48,423 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 27 [2021-12-21 18:05:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:48,423 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2021-12-21 18:05:48,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2021-12-21 18:05:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:05:48,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:48,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:48,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 18:05:48,424 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:48,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1264836991, now seen corresponding path program 1 times [2021-12-21 18:05:48,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:48,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556912538] [2021-12-21 18:05:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:48,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:48,676 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:05:48,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:48,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556912538] [2021-12-21 18:05:48,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556912538] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:48,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:48,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-21 18:05:48,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395319150] [2021-12-21 18:05:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:48,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 18:05:48,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:48,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 18:05:48,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-12-21 18:05:48,677 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:49,109 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2021-12-21 18:05:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 18:05:49,109 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-21 18:05:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:49,110 INFO L225 Difference]: With dead ends: 159 [2021-12-21 18:05:49,110 INFO L226 Difference]: Without dead ends: 159 [2021-12-21 18:05:49,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2021-12-21 18:05:49,111 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 195 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:49,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 774 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:05:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-21 18:05:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 128. [2021-12-21 18:05:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 127 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2021-12-21 18:05:49,115 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 28 [2021-12-21 18:05:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:49,115 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2021-12-21 18:05:49,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2021-12-21 18:05:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:05:49,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:49,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:49,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-21 18:05:49,116 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:49,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2059816375, now seen corresponding path program 1 times [2021-12-21 18:05:49,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:49,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596376737] [2021-12-21 18:05:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:49,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:49,149 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:05:49,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:49,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596376737] [2021-12-21 18:05:49,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596376737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:49,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:49,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:05:49,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705000259] [2021-12-21 18:05:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:49,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:05:49,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:05:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:05:49,151 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:49,231 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2021-12-21 18:05:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:05:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 18:05:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:49,232 INFO L225 Difference]: With dead ends: 146 [2021-12-21 18:05:49,232 INFO L226 Difference]: Without dead ends: 146 [2021-12-21 18:05:49,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:05:49,233 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:49,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 131 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-21 18:05:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2021-12-21 18:05:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 126 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2021-12-21 18:05:49,236 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 29 [2021-12-21 18:05:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:49,236 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2021-12-21 18:05:49,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2021-12-21 18:05:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:05:49,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:49,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:49,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 18:05:49,236 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2059816374, now seen corresponding path program 1 times [2021-12-21 18:05:49,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:49,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723193052] [2021-12-21 18:05:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:49,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:49,553 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:05:49,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:49,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723193052] [2021-12-21 18:05:49,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723193052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:49,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:49,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-21 18:05:49,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575703004] [2021-12-21 18:05:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:49,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-21 18:05:49,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-21 18:05:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-21 18:05:49,556 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:50,221 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2021-12-21 18:05:50,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:05:50,222 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 18:05:50,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:50,223 INFO L225 Difference]: With dead ends: 202 [2021-12-21 18:05:50,223 INFO L226 Difference]: Without dead ends: 202 [2021-12-21 18:05:50,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2021-12-21 18:05:50,224 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 473 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:50,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 1196 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:05:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-21 18:05:50,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 132. [2021-12-21 18:05:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.4181818181818182) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2021-12-21 18:05:50,227 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 29 [2021-12-21 18:05:50,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:50,227 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2021-12-21 18:05:50,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2021-12-21 18:05:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:05:50,228 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:50,228 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] [2021-12-21 18:05:50,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-21 18:05:50,228 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:50,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1348537848, now seen corresponding path program 1 times [2021-12-21 18:05:50,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:50,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896263610] [2021-12-21 18:05:50,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:50,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:50,472 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:05:50,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896263610] [2021-12-21 18:05:50,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896263610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:50,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:50,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-21 18:05:50,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025254780] [2021-12-21 18:05:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:50,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 18:05:50,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:50,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 18:05:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:05:50,474 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:50,903 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2021-12-21 18:05:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 18:05:50,903 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-21 18:05:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:50,904 INFO L225 Difference]: With dead ends: 173 [2021-12-21 18:05:50,904 INFO L226 Difference]: Without dead ends: 173 [2021-12-21 18:05:50,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2021-12-21 18:05:50,905 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 246 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:50,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 747 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:05:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-21 18:05:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2021-12-21 18:05:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.407079646017699) internal successors, (159), 134 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2021-12-21 18:05:50,908 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 30 [2021-12-21 18:05:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:50,908 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2021-12-21 18:05:50,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2021-12-21 18:05:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:05:50,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:50,909 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] [2021-12-21 18:05:50,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-21 18:05:50,910 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash 570254421, now seen corresponding path program 1 times [2021-12-21 18:05:50,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:50,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784681755] [2021-12-21 18:05:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:50,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:05:51,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:51,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784681755] [2021-12-21 18:05:51,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784681755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:51,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:51,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-12-21 18:05:51,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876739315] [2021-12-21 18:05:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:51,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 18:05:51,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 18:05:51,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2021-12-21 18:05:51,619 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:52,823 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2021-12-21 18:05:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 18:05:52,823 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-21 18:05:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:52,824 INFO L225 Difference]: With dead ends: 140 [2021-12-21 18:05:52,824 INFO L226 Difference]: Without dead ends: 140 [2021-12-21 18:05:52,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2021-12-21 18:05:52,825 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 232 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:52,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 914 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:05:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-21 18:05:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2021-12-21 18:05:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-21 18:05:52,828 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 30 [2021-12-21 18:05:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:52,828 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-21 18:05:52,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-21 18:05:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 18:05:52,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:52,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:05:52,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-21 18:05:52,830 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1144999879, now seen corresponding path program 1 times [2021-12-21 18:05:52,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:52,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106928866] [2021-12-21 18:05:52,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:52,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:53,115 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:05:53,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:53,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106928866] [2021-12-21 18:05:53,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106928866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:53,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:53,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-21 18:05:53,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201603545] [2021-12-21 18:05:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:53,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 18:05:53,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 18:05:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:05:53,117 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:53,609 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-21 18:05:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 18:05:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-21 18:05:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:53,610 INFO L225 Difference]: With dead ends: 150 [2021-12-21 18:05:53,610 INFO L226 Difference]: Without dead ends: 150 [2021-12-21 18:05:53,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2021-12-21 18:05:53,611 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 206 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:53,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 587 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:05:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-21 18:05:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2021-12-21 18:05:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-12-21 18:05:53,614 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 31 [2021-12-21 18:05:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:53,615 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-12-21 18:05:53,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-12-21 18:05:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 18:05:53,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:53,615 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:05:53,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-21 18:05:53,616 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1135258090, now seen corresponding path program 1 times [2021-12-21 18:05:53,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:53,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574166645] [2021-12-21 18:05:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:53,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:05:53,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:53,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574166645] [2021-12-21 18:05:53,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574166645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:53,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:53,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:05:53,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512915827] [2021-12-21 18:05:53,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:53,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:05:53,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:05:53,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:05:53,662 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:53,761 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2021-12-21 18:05:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:05:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 18:05:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:53,762 INFO L225 Difference]: With dead ends: 134 [2021-12-21 18:05:53,763 INFO L226 Difference]: Without dead ends: 134 [2021-12-21 18:05:53,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:05:53,764 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:53,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 315 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-21 18:05:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-12-21 18:05:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-21 18:05:53,774 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 32 [2021-12-21 18:05:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:53,774 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-21 18:05:53,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-21 18:05:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-21 18:05:53,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:53,775 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] [2021-12-21 18:05:53,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-21 18:05:53,776 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash 833262606, now seen corresponding path program 1 times [2021-12-21 18:05:53,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:53,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562730021] [2021-12-21 18:05:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:53,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:05:54,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:54,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562730021] [2021-12-21 18:05:54,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562730021] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:05:54,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053997560] [2021-12-21 18:05:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:54,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:05:54,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:05:54,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:05:54,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 18:05:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:54,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-21 18:05:54,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:05:54,321 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 10 treesize of output 8 [2021-12-21 18:05:54,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:05:54,398 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:05:54,399 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:05:54,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:05:54,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:05:54,589 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:05:54,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-21 18:05:54,617 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:05:54,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-21 18:05:54,717 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:05:54,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-21 18:05:54,744 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:05:54,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-21 18:05:54,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-21 18:05:55,034 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:05:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:05:55,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:05:55,110 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 6 treesize of output 4 [2021-12-21 18:05:55,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1050) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1050) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,237 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1048) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1048) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1049)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1) v_ArrVal_1051))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-21 18:05:55,368 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:05:55,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 58 [2021-12-21 18:05:55,381 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-21 18:05:55,381 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 2 case distinctions, treesize of input 75 treesize of output 79 [2021-12-21 18:05:55,390 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 18:05:55,391 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 419 treesize of output 325 [2021-12-21 18:05:55,415 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 18:05:55,415 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 184 treesize of output 156 [2021-12-21 18:05:55,420 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 156 treesize of output 148 [2021-12-21 18:05:55,429 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:05:55,430 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 13 treesize of output 12 [2021-12-21 18:05:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:05:55,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053997560] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:05:55,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:05:55,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 20] total 44 [2021-12-21 18:05:55,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86338945] [2021-12-21 18:05:55,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:05:55,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-21 18:05:55,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:55,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-21 18:05:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1131, Unknown=9, NotChecked=684, Total=1980 [2021-12-21 18:05:55,473 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:56,569 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2021-12-21 18:05:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 18:05:56,570 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-21 18:05:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:56,571 INFO L225 Difference]: With dead ends: 148 [2021-12-21 18:05:56,571 INFO L226 Difference]: Without dead ends: 148 [2021-12-21 18:05:56,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=1973, Unknown=9, NotChecked=900, Total=3192 [2021-12-21 18:05:56,572 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 233 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 841 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:56,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1211 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 821 Invalid, 0 Unknown, 841 Unchecked, 0.4s Time] [2021-12-21 18:05:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-21 18:05:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2021-12-21 18:05:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-12-21 18:05:56,575 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 33 [2021-12-21 18:05:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:56,575 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-12-21 18:05:56,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-12-21 18:05:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 18:05:56,576 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:56,576 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:05:56,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 18:05:56,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-21 18:05:56,796 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2032785906, now seen corresponding path program 1 times [2021-12-21 18:05:56,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:56,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790563032] [2021-12-21 18:05:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:56,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:56,892 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:05:56,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:56,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790563032] [2021-12-21 18:05:56,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790563032] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:56,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:56,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:05:56,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108368875] [2021-12-21 18:05:56,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:56,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:05:56,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:56,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:05:56,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:05:56,894 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:57,071 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2021-12-21 18:05:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:05:57,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-21 18:05:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:57,073 INFO L225 Difference]: With dead ends: 231 [2021-12-21 18:05:57,073 INFO L226 Difference]: Without dead ends: 231 [2021-12-21 18:05:57,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:05:57,073 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 212 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:57,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 237 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:05:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-21 18:05:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 145. [2021-12-21 18:05:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 144 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 171 transitions. [2021-12-21 18:05:57,076 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 171 transitions. Word has length 35 [2021-12-21 18:05:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:57,077 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 171 transitions. [2021-12-21 18:05:57,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 171 transitions. [2021-12-21 18:05:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:05:57,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:57,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:05:57,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-21 18:05:57,077 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1408146296, now seen corresponding path program 1 times [2021-12-21 18:05:57,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:57,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067449085] [2021-12-21 18:05:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:57,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:57,106 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:05:57,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:57,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067449085] [2021-12-21 18:05:57,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067449085] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:57,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:57,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:05:57,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894221672] [2021-12-21 18:05:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:57,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:05:57,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:57,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:05:57,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:05:57,108 INFO L87 Difference]: Start difference. First operand 145 states and 171 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:57,166 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2021-12-21 18:05:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:05:57,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-21 18:05:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:57,168 INFO L225 Difference]: With dead ends: 161 [2021-12-21 18:05:57,168 INFO L226 Difference]: Without dead ends: 161 [2021-12-21 18:05:57,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:05:57,169 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:57,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 136 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-21 18:05:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2021-12-21 18:05:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 142 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2021-12-21 18:05:57,172 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 36 [2021-12-21 18:05:57,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:57,172 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2021-12-21 18:05:57,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2021-12-21 18:05:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:05:57,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:57,173 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:05:57,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-21 18:05:57,173 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:57,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1408146295, now seen corresponding path program 1 times [2021-12-21 18:05:57,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:57,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594440525] [2021-12-21 18:05:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:57,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:57,206 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:05:57,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:57,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594440525] [2021-12-21 18:05:57,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594440525] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:05:57,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:05:57,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:05:57,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429514682] [2021-12-21 18:05:57,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:05:57,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:05:57,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:05:57,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:05:57,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:05:57,208 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:05:57,263 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2021-12-21 18:05:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:05:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-21 18:05:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:05:57,264 INFO L225 Difference]: With dead ends: 164 [2021-12-21 18:05:57,264 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 18:05:57,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:05:57,265 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:05:57,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 138 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:05:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 18:05:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2021-12-21 18:05:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 140 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2021-12-21 18:05:57,268 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 36 [2021-12-21 18:05:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:05:57,269 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2021-12-21 18:05:57,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:05:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2021-12-21 18:05:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:05:57,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:05:57,269 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:05:57,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-21 18:05:57,270 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:05:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:05:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1408093625, now seen corresponding path program 1 times [2021-12-21 18:05:57,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:05:57,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249590580] [2021-12-21 18:05:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:57,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:05:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:05:58,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:05:58,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249590580] [2021-12-21 18:05:58,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249590580] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:05:58,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918668177] [2021-12-21 18:05:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:05:58,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:05:58,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:05:58,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:05:58,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 18:05:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:05:58,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 103 conjunts are in the unsatisfiable core [2021-12-21 18:05:58,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:05:58,227 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:05:58,228 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 19 treesize of output 18 [2021-12-21 18:05:58,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:05:58,335 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-21 18:05:58,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-21 18:05:58,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:05:58,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-21 18:05:58,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:05:58,668 INFO L353 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-21 18:05:58,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 64 [2021-12-21 18:05:58,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2021-12-21 18:05:58,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:05:58,800 INFO L353 Elim1Store]: treesize reduction 152, result has 15.6 percent of original size [2021-12-21 18:05:58,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 84 [2021-12-21 18:05:58,811 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-21 18:05:58,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76 [2021-12-21 18:05:59,068 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-21 18:05:59,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 124 [2021-12-21 18:05:59,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2021-12-21 18:05:59,113 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-21 18:05:59,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 117 [2021-12-21 18:05:59,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2021-12-21 18:05:59,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:05:59,935 INFO L353 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2021-12-21 18:05:59,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 63 [2021-12-21 18:06:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:06:00,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:00,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918668177] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:00,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:06:00,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [25] total 46 [2021-12-21 18:06:00,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931302314] [2021-12-21 18:06:00,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:00,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-21 18:06:00,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:06:00,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-21 18:06:00,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1951, Unknown=0, NotChecked=0, Total=2070 [2021-12-21 18:06:00,146 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:01,312 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-12-21 18:06:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 18:06:01,313 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-21 18:06:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:01,314 INFO L225 Difference]: With dead ends: 141 [2021-12-21 18:06:01,314 INFO L226 Difference]: Without dead ends: 141 [2021-12-21 18:06:01,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=257, Invalid=3525, Unknown=0, NotChecked=0, Total=3782 [2021-12-21 18:06:01,315 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:01,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 731 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 310 Invalid, 0 Unknown, 152 Unchecked, 0.2s Time] [2021-12-21 18:06:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-21 18:06:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-12-21 18:06:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 140 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2021-12-21 18:06:01,318 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 36 [2021-12-21 18:06:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:01,318 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2021-12-21 18:06:01,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2021-12-21 18:06:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:06:01,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:01,319 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:06:01,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 18:06:01,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-21 18:06:01,520 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1406246583, now seen corresponding path program 1 times [2021-12-21 18:06:01,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:06:01,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138117700] [2021-12-21 18:06:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:01,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:06:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:06:01,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:06:01,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138117700] [2021-12-21 18:06:01,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138117700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:01,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:01,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:06:01,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091154301] [2021-12-21 18:06:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:01,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:06:01,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:06:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:06:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:06:01,549 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:01,554 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-12-21 18:06:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:06:01,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-21 18:06:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:01,555 INFO L225 Difference]: With dead ends: 130 [2021-12-21 18:06:01,555 INFO L226 Difference]: Without dead ends: 130 [2021-12-21 18:06:01,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:06:01,557 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:01,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:06:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-21 18:06:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-12-21 18:06:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.25) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2021-12-21 18:06:01,561 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 36 [2021-12-21 18:06:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:01,561 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2021-12-21 18:06:01,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2021-12-21 18:06:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 18:06:01,563 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:01,563 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-12-21 18:06:01,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-21 18:06:01,563 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash -183715591, now seen corresponding path program 1 times [2021-12-21 18:06:01,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:06:01,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386455941] [2021-12-21 18:06:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:01,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:06:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:06:02,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:06:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386455941] [2021-12-21 18:06:02,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386455941] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:06:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064883560] [2021-12-21 18:06:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:02,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:06:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:06:02,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:06:02,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 18:06:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:02,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-21 18:06:02,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:02,425 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:02,425 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 19 treesize of output 18 [2021-12-21 18:06:02,474 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:06:02,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:06:02,545 INFO L353 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-12-21 18:06:02,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-12-21 18:06:02,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:02,612 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:06:02,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:02,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2021-12-21 18:06:02,775 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 22 treesize of output 10 [2021-12-21 18:06:02,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:02,925 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-21 18:06:02,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 55 [2021-12-21 18:06:03,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:03,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:06:03,025 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-21 18:06:03,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 55 [2021-12-21 18:06:03,315 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-21 18:06:03,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 87 [2021-12-21 18:06:03,353 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-21 18:06:03,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 80 [2021-12-21 18:06:03,785 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:06:03,960 INFO L353 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2021-12-21 18:06:03,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 95 treesize of output 73 [2021-12-21 18:06:04,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2021-12-21 18:06:04,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 26 [2021-12-21 18:06:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:06:04,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:06:04,573 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 47 treesize of output 35 [2021-12-21 18:06:04,618 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse1 .cse2) 0) .cse2)))))) is different from false [2021-12-21 18:06:04,629 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) 0))))))) is different from false [2021-12-21 18:06:04,642 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) 0))))))) is different from false [2021-12-21 18:06:04,652 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) 0))))))) is different from false [2021-12-21 18:06:04,670 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse0 .cse1) 0) .cse1))))) (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1))) is different from false [2021-12-21 18:06:04,682 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse3 (select (select .cse4 .cse3) 0))))))) is different from false [2021-12-21 18:06:04,695 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse1 (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| .cse5)))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse5)))))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_1453))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) 0)))))) (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse6 (let ((.cse8 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse7 (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| .cse10)))) (store .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse10)))))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8) v_ArrVal_1453))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1))) is different from false [2021-12-21 18:06:04,711 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (select .cse6 .cse2))) (let ((.cse3 (let ((.cse5 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) .cse4))))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse4))))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse2) v_ArrVal_1453))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse7 (let ((.cse10 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse9 (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse12 (select .cse14 .cse10))) (let ((.cse11 (let ((.cse13 (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) .cse12))))) (store .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse12))))))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse10) v_ArrVal_1453))))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse7 .cse8) 0) .cse8)))))) is different from false [2021-12-21 18:06:05,611 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:06:05,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 483 treesize of output 362 [2021-12-21 18:06:05,632 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-21 18:06:05,633 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 2 case distinctions, treesize of input 336 treesize of output 334 [2021-12-21 18:06:05,637 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 334 treesize of output 314 [2021-12-21 18:06:05,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:06:05,752 INFO L353 Elim1Store]: treesize reduction 153, result has 36.5 percent of original size [2021-12-21 18:06:05,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 395 treesize of output 332 [2021-12-21 18:06:05,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:06:05,805 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-21 18:06:05,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 354 treesize of output 362 [2021-12-21 18:06:05,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:06:05,873 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-21 18:06:05,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 403 treesize of output 397 [2021-12-21 18:06:05,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:06:05,970 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-21 18:06:05,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 416 treesize of output 420 [2021-12-21 18:06:05,986 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-21 18:06:05,986 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:06:05,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-21 18:06:05,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405361267] [2021-12-21 18:06:05,987 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 18:06:05,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-21 18:06:05,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:06:05,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 18:06:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2515, Unknown=56, NotChecked=872, Total=3660 [2021-12-21 18:06:05,989 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 18:06:05,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=217, Invalid=2515, Unknown=56, NotChecked=872, Total=3660 [2021-12-21 18:06:05,991 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:05,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:06:06,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:06:06,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:06:06,216 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2e7bbbd3 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-21 18:06:06,219 INFO L158 Benchmark]: Toolchain (without parser) took 27153.83ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 77.7MB in the beginning and 108.0MB in the end (delta: -30.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2021-12-21 18:06:06,220 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 86.0MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 40.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:06:06,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.12ms. Allocated memory is still 109.1MB. Free memory was 77.5MB in the beginning and 80.4MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 18:06:06,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.89ms. Allocated memory is still 109.1MB. Free memory was 80.0MB in the beginning and 77.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:06:06,220 INFO L158 Benchmark]: Boogie Preprocessor took 30.96ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 76.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:06:06,220 INFO L158 Benchmark]: RCFGBuilder took 650.65ms. Allocated memory is still 109.1MB. Free memory was 76.2MB in the beginning and 54.3MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-21 18:06:06,221 INFO L158 Benchmark]: TraceAbstraction took 26016.84ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 53.7MB in the beginning and 108.0MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:06:06,222 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.20ms. Allocated memory is still 86.0MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 40.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.12ms. Allocated memory is still 109.1MB. Free memory was 77.5MB in the beginning and 80.4MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.89ms. Allocated memory is still 109.1MB. Free memory was 80.0MB in the beginning and 77.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.96ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 76.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 650.65ms. Allocated memory is still 109.1MB. Free memory was 76.2MB in the beginning and 54.3MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 26016.84ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 53.7MB in the beginning and 108.0MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2e7bbbd3 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2e7bbbd3: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-21 18:06:06,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/memsafety-ext/skiplist_2lvl.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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:06:08,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:06:08,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:06:08,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:06:08,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:06:08,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:06:08,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:06:08,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:06:08,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:06:08,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:06:08,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:06:08,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:06:08,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:06:08,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:06:08,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:06:08,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:06:08,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:06:08,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:06:08,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:06:08,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:06:08,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:06:08,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:06:08,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:06:08,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:06:08,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:06:08,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:06:08,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:06:08,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:06:08,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:06:08,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:06:08,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:06:08,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:06:08,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:06:08,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:06:08,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:06:08,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:06:08,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:06:08,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:06:08,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:06:08,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:06:08,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:06:08,254 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:06:08,291 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:06:08,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:06:08,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:06:08,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:06:08,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:06:08,294 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:06:08,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:06:08,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:06:08,295 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:06:08,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:06:08,296 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:06:08,297 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:06:08,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:06:08,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:06:08,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:06:08,298 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:06:08,298 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:06:08,298 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:06:08,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:06:08,299 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:06:08,299 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 18:06:08,299 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 18:06:08,299 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:06:08,299 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:06:08,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:06:08,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:06:08,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:06:08,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:06:08,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:06:08,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:06:08,301 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 18:06:08,301 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 18:06:08,302 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:06:08,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 18:06:08,302 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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2021-12-21 18:06:08,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:06:08,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:06:08,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:06:08,635 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:06:08,636 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:06:08,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-21 18:06:08,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f115d3a90/ed975c84d4bb45df9e768ff4d6a55a2d/FLAGbf6a1299e [2021-12-21 18:06:09,212 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:06:09,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-21 18:06:09,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f115d3a90/ed975c84d4bb45df9e768ff4d6a55a2d/FLAGbf6a1299e [2021-12-21 18:06:09,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f115d3a90/ed975c84d4bb45df9e768ff4d6a55a2d [2021-12-21 18:06:09,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:06:09,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:06:09,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:06:09,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:06:09,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:06:09,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:06:09" (1/1) ... [2021-12-21 18:06:09,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1776211a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:09, skipping insertion in model container [2021-12-21 18:06:09,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:06:09" (1/1) ... [2021-12-21 18:06:09,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:06:09,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:06:09,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:06:09,941 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:06:09,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:06:10,007 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:06:10,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10 WrapperNode [2021-12-21 18:06:10,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:06:10,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:06:10,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:06:10,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:06:10,017 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:06:10" (1/1) ... [2021-12-21 18:06:10,037 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:06:10" (1/1) ... [2021-12-21 18:06:10,058 INFO L137 Inliner]: procedures = 128, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 125 [2021-12-21 18:06:10,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:06:10,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:06:10,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:06:10,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:06:10,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (1/1) ... [2021-12-21 18:06:10,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (1/1) ... [2021-12-21 18:06:10,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (1/1) ... [2021-12-21 18:06:10,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (1/1) ... [2021-12-21 18:06:10,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (1/1) ... [2021-12-21 18:06:10,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (1/1) ... [2021-12-21 18:06:10,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (1/1) ... [2021-12-21 18:06:10,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:06:10,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:06:10,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:06:10,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:06:10,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (1/1) ... [2021-12-21 18:06:10,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:06:10,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:06:10,123 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:06:10,140 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:06:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:06:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:06:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:06:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:06:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:06:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 18:06:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:06:10,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:06:10,259 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:06:10,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:06:10,906 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:06:10,912 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:06:10,913 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 18:06:10,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:06:10 BoogieIcfgContainer [2021-12-21 18:06:10,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:06:10,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:06:10,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:06:10,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:06:10,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:06:09" (1/3) ... [2021-12-21 18:06:10,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7402ed6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:06:10, skipping insertion in model container [2021-12-21 18:06:10,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:06:10" (2/3) ... [2021-12-21 18:06:10,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7402ed6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:06:10, skipping insertion in model container [2021-12-21 18:06:10,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:06:10" (3/3) ... [2021-12-21 18:06:10,921 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2021-12-21 18:06:10,925 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:06:10,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-21 18:06:10,962 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:06:10,967 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:06:10,967 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-21 18:06:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 61 states have (on average 2.2131147540983607) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 18:06:10,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:10,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 18:06:10,985 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-21 18:06:10,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:11,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397236187] [2021-12-21 18:06:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:11,000 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:11,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:11,017 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:06:11,020 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:06:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:11,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:06:11,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:11,183 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 18:06:11,185 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 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-21 18:06:11,210 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:06:11,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:11,211 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:11,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397236187] [2021-12-21 18:06:11,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397236187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:11,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:11,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:06:11,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068562882] [2021-12-21 18:06:11,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:11,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:06:11,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:06:11,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:06:11,250 INFO L87 Difference]: Start difference. First operand has 127 states, 61 states have (on average 2.2131147540983607) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:11,561 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-12-21 18:06:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:06:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-21 18:06:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:11,578 INFO L225 Difference]: With dead ends: 150 [2021-12-21 18:06:11,580 INFO L226 Difference]: Without dead ends: 148 [2021-12-21 18:06:11,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:06:11,595 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 114 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:11,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 78 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:06:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-21 18:06:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2021-12-21 18:06:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 60 states have (on average 2.033333333333333) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2021-12-21 18:06:11,658 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 3 [2021-12-21 18:06:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:11,659 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2021-12-21 18:06:11,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2021-12-21 18:06:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 18:06:11,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:11,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 18:06:11,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-21 18:06:11,875 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:06:11,876 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:11,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-21 18:06:11,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:11,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425541592] [2021-12-21 18:06:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:11,877 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:11,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:11,878 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:06:11,879 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:06:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:11,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:06:11,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:11,964 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:11,965 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 1 case distinctions, treesize of input 9 treesize of output 11 [2021-12-21 18:06:11,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:06:11,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:11,988 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:11,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425541592] [2021-12-21 18:06:11,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425541592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:11,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:11,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:06:11,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812598720] [2021-12-21 18:06:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:11,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:06:11,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:06:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:06:11,997 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:12,235 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-12-21 18:06:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:06:12,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-21 18:06:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:12,237 INFO L225 Difference]: With dead ends: 111 [2021-12-21 18:06:12,238 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 18:06:12,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:06:12,239 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:12,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 61 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:06:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 18:06:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-21 18:06:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 60 states have (on average 1.9166666666666667) internal successors, (115), 110 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2021-12-21 18:06:12,245 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 3 [2021-12-21 18:06:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:12,246 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2021-12-21 18:06:12,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2021-12-21 18:06:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:06:12,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:12,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:12,264 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:06:12,462 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:06:12,462 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:12,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:12,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606480, now seen corresponding path program 1 times [2021-12-21 18:06:12,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:12,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174401796] [2021-12-21 18:06:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:12,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:12,469 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:06:12,471 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:06:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:12,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:06:12,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:12,584 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-21 18:06:12,585 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 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-21 18:06:12,622 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:06:12,678 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-21 18:06:12,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 35 [2021-12-21 18:06:12,730 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 18:06:12,731 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 26 treesize of output 25 [2021-12-21 18:06:12,748 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:06:12,758 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:06:12,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:12,758 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:12,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174401796] [2021-12-21 18:06:12,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174401796] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:12,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:12,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:06:12,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945355438] [2021-12-21 18:06:12,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:12,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:06:12,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:12,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:06:12,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:06:12,760 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:13,116 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2021-12-21 18:06:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:06:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-21 18:06:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:13,118 INFO L225 Difference]: With dead ends: 110 [2021-12-21 18:06:13,118 INFO L226 Difference]: Without dead ends: 110 [2021-12-21 18:06:13,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:06:13,119 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:13,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 262 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:06:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-21 18:06:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-21 18:06:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.9) internal successors, (114), 109 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2021-12-21 18:06:13,125 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 10 [2021-12-21 18:06:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:13,126 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2021-12-21 18:06:13,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2021-12-21 18:06:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:06:13,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:13,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:13,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:06:13,331 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:06:13,332 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:13,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606481, now seen corresponding path program 1 times [2021-12-21 18:06:13,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:13,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784050429] [2021-12-21 18:06:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:13,335 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:13,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:13,336 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:06:13,338 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:06:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:13,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 18:06:13,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:13,434 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:06:13,435 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-21 18:06:13,476 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-21 18:06:13,476 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 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-21 18:06:13,516 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:06:13,528 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:06:13,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:13,571 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 16 treesize of output 18 [2021-12-21 18:06:13,583 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-21 18:06:13,583 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 15 [2021-12-21 18:06:13,624 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 18:06:13,624 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 23 treesize of output 22 [2021-12-21 18:06:13,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:13,640 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:06:13,674 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:06:13,678 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:06:13,700 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:06:13,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:13,701 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:13,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784050429] [2021-12-21 18:06:13,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784050429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:13,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:13,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:06:13,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417505869] [2021-12-21 18:06:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:13,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:06:13,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:06:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:06:13,704 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:14,115 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-12-21 18:06:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:06:14,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-21 18:06:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:14,116 INFO L225 Difference]: With dead ends: 109 [2021-12-21 18:06:14,116 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 18:06:14,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:06:14,117 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:14,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 251 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:06:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 18:06:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-21 18:06:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.8833333333333333) internal successors, (113), 108 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2021-12-21 18:06:14,123 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 10 [2021-12-21 18:06:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:14,123 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2021-12-21 18:06:14,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2021-12-21 18:06:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:06:14,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:14,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:14,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-21 18:06:14,327 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:06:14,327 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-12-21 18:06:14,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:14,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004175250] [2021-12-21 18:06:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:14,328 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:14,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:14,329 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:06:14,330 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:06:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:14,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:06:14,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:14,434 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:06:14,454 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:06:14,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:14,454 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004175250] [2021-12-21 18:06:14,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004175250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:14,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:14,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:06:14,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778664423] [2021-12-21 18:06:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:14,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:06:14,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:14,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:06:14,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:06:14,459 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:14,665 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2021-12-21 18:06:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:06:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-21 18:06:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:14,667 INFO L225 Difference]: With dead ends: 108 [2021-12-21 18:06:14,667 INFO L226 Difference]: Without dead ends: 108 [2021-12-21 18:06:14,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:06:14,668 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 6 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:14,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:06:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-21 18:06:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-21 18:06:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 107 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2021-12-21 18:06:14,673 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 11 [2021-12-21 18:06:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:14,673 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2021-12-21 18:06:14,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2021-12-21 18:06:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:06:14,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:14,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:14,681 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:06:14,879 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:06:14,880 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-12-21 18:06:14,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:14,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788152646] [2021-12-21 18:06:14,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:14,881 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:14,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:14,882 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:06:14,883 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:06:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:14,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 18:06:14,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:15,013 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:06:15,014 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-21 18:06:15,032 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-21 18:06:15,033 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 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-21 18:06:15,061 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:06:15,072 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:06:15,121 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-21 18:06:15,122 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 15 [2021-12-21 18:06:15,128 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 16 treesize of output 18 [2021-12-21 18:06:15,167 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 18:06:15,167 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:06:15,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:15,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 18:06:15,212 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:06:15,216 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:06:15,253 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:06:15,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:15,253 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:15,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788152646] [2021-12-21 18:06:15,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788152646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:15,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:15,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:06:15,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334897953] [2021-12-21 18:06:15,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:15,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:06:15,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:15,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:06:15,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:06:15,255 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:15,713 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2021-12-21 18:06:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:06:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-21 18:06:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:15,715 INFO L225 Difference]: With dead ends: 107 [2021-12-21 18:06:15,715 INFO L226 Difference]: Without dead ends: 107 [2021-12-21 18:06:15,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:06:15,715 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:15,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:06:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-21 18:06:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-21 18:06:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.85) internal successors, (111), 106 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2021-12-21 18:06:15,720 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 11 [2021-12-21 18:06:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:15,720 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2021-12-21 18:06:15,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2021-12-21 18:06:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:06:15,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:15,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:15,730 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:06:15,930 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:06:15,930 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -266592339, now seen corresponding path program 1 times [2021-12-21 18:06:15,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:15,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536547181] [2021-12-21 18:06:15,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:15,931 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:15,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:15,933 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:06:15,936 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:06:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:16,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 18:06:16,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:16,036 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 12 treesize of output 10 [2021-12-21 18:06:16,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:06:16,067 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:06:16,106 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 18:06:16,106 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 22 treesize of output 21 [2021-12-21 18:06:16,254 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:16,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2021-12-21 18:06:16,278 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:16,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-21 18:06:16,314 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 18:06:16,315 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 29 treesize of output 13 [2021-12-21 18:06:16,327 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:06:16,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:16,328 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536547181] [2021-12-21 18:06:16,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536547181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:16,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:16,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:06:16,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946939892] [2021-12-21 18:06:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:16,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:06:16,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:06:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:06:16,329 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:16,817 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-12-21 18:06:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:06:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 18:06:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:16,818 INFO L225 Difference]: With dead ends: 106 [2021-12-21 18:06:16,818 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 18:06:16,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:06:16,819 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 16 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:16,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 465 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:06:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 18:06:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-21 18:06:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 105 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2021-12-21 18:06:16,825 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 15 [2021-12-21 18:06:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:16,826 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2021-12-21 18:06:16,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2021-12-21 18:06:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:06:16,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:16,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:16,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-21 18:06:17,037 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:06:17,038 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash -266592338, now seen corresponding path program 1 times [2021-12-21 18:06:17,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:17,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303077323] [2021-12-21 18:06:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:17,039 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:17,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:17,044 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:06:17,045 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:06:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:17,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 18:06:17,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:17,164 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 12 treesize of output 10 [2021-12-21 18:06:17,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:06:17,193 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:06:17,235 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 18:06:17,236 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 22 treesize of output 21 [2021-12-21 18:06:17,247 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:06:17,417 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:17,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-21 18:06:17,426 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 20 treesize of output 22 [2021-12-21 18:06:17,484 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:17,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-21 18:06:17,491 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 20 treesize of output 22 [2021-12-21 18:06:17,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:17,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-12-21 18:06:17,564 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 19 treesize of output 7 [2021-12-21 18:06:17,582 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:06:17,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:17,583 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:17,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303077323] [2021-12-21 18:06:17,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303077323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:17,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:17,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:06:17,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366247504] [2021-12-21 18:06:17,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:17,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:06:17,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:17,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:06:17,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:06:17,586 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:18,095 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2021-12-21 18:06:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:06:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 18:06:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:18,096 INFO L225 Difference]: With dead ends: 105 [2021-12-21 18:06:18,096 INFO L226 Difference]: Without dead ends: 105 [2021-12-21 18:06:18,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:06:18,099 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:18,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 430 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:06:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-21 18:06:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-21 18:06:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 104 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2021-12-21 18:06:18,104 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 15 [2021-12-21 18:06:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:18,105 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2021-12-21 18:06:18,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2021-12-21 18:06:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 18:06:18,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:18,105 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:06:18,115 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:06:18,311 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:06:18,312 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:18,312 INFO L85 PathProgramCache]: Analyzing trace with hash 325572089, now seen corresponding path program 1 times [2021-12-21 18:06:18,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:18,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195880422] [2021-12-21 18:06:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:18,313 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:18,313 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:06:18,314 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:06:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:18,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:06:18,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:18,447 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 19 treesize of output 7 [2021-12-21 18:06:18,464 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:06:18,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:18,465 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:18,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195880422] [2021-12-21 18:06:18,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195880422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:18,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:18,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:06:18,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103593593] [2021-12-21 18:06:18,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:18,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:06:18,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:18,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:06:18,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:06:18,466 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:18,699 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-12-21 18:06:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:06:18,699 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-21 18:06:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:18,700 INFO L225 Difference]: With dead ends: 104 [2021-12-21 18:06:18,700 INFO L226 Difference]: Without dead ends: 104 [2021-12-21 18:06:18,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:06:18,701 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:18,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 331 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:06:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-21 18:06:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-21 18:06:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.8) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2021-12-21 18:06:18,703 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 16 [2021-12-21 18:06:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:18,704 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2021-12-21 18:06:18,704 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2021-12-21 18:06:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 18:06:18,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:18,704 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:06:18,714 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:06:18,914 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:06:18,914 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash 325572090, now seen corresponding path program 1 times [2021-12-21 18:06:18,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:18,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023142910] [2021-12-21 18:06:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:18,915 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:18,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:18,916 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:06:18,919 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:06:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:19,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-21 18:06:19,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:19,042 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 12 treesize of output 10 [2021-12-21 18:06:19,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:06:19,075 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:06:19,116 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 18:06:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:06:19,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 13 treesize of output 9 [2021-12-21 18:06:19,291 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:19,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-21 18:06:19,298 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 20 treesize of output 22 [2021-12-21 18:06:19,332 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:19,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-21 18:06:19,338 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 20 treesize of output 22 [2021-12-21 18:06:19,368 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 19 treesize of output 7 [2021-12-21 18:06:19,374 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 18:06:19,374 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 29 treesize of output 13 [2021-12-21 18:06:19,403 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:06:19,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:19,404 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:19,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023142910] [2021-12-21 18:06:19,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023142910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:19,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:19,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:06:19,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228522830] [2021-12-21 18:06:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:19,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:06:19,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:19,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:06:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:06:19,405 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:19,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:19,731 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-12-21 18:06:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:06:19,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-21 18:06:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:19,733 INFO L225 Difference]: With dead ends: 103 [2021-12-21 18:06:19,733 INFO L226 Difference]: Without dead ends: 103 [2021-12-21 18:06:19,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:06:19,734 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 17 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:19,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 320 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:06:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-21 18:06:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-12-21 18:06:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 102 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2021-12-21 18:06:19,736 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 16 [2021-12-21 18:06:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:19,737 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2021-12-21 18:06:19,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2021-12-21 18:06:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 18:06:19,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:19,737 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] [2021-12-21 18:06:19,748 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:06:19,945 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:06:19,945 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash -819039076, now seen corresponding path program 1 times [2021-12-21 18:06:19,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122760452] [2021-12-21 18:06:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:19,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:19,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:19,947 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:06:19,949 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:06:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:20,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:06:20,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:20,116 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:06:20,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:20,117 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:20,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122760452] [2021-12-21 18:06:20,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122760452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:20,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:20,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:06:20,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033690275] [2021-12-21 18:06:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:20,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:06:20,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:20,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:06:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:06:20,120 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:20,478 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2021-12-21 18:06:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:06:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-21 18:06:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:20,482 INFO L225 Difference]: With dead ends: 163 [2021-12-21 18:06:20,482 INFO L226 Difference]: Without dead ends: 163 [2021-12-21 18:06:20,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:06:20,483 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 339 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:20,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 145 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:06:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-21 18:06:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 101. [2021-12-21 18:06:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 100 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2021-12-21 18:06:20,487 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 20 [2021-12-21 18:06:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:20,487 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2021-12-21 18:06:20,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2021-12-21 18:06:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 18:06:20,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:20,488 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] [2021-12-21 18:06:20,499 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:06:20,696 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:06:20,697 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:20,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:20,697 INFO L85 PathProgramCache]: Analyzing trace with hash -819039075, now seen corresponding path program 1 times [2021-12-21 18:06:20,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:20,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977766043] [2021-12-21 18:06:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:20,698 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:20,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:20,699 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:06:20,701 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:06:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:20,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:06:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:20,920 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:06:20,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:20,920 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:20,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977766043] [2021-12-21 18:06:20,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977766043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:20,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:20,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:06:20,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049012669] [2021-12-21 18:06:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:20,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:06:20,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:06:20,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:06:20,922 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:21,330 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2021-12-21 18:06:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:06:21,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-21 18:06:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:21,331 INFO L225 Difference]: With dead ends: 134 [2021-12-21 18:06:21,332 INFO L226 Difference]: Without dead ends: 134 [2021-12-21 18:06:21,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:06:21,332 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 437 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:21,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 107 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:06:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-21 18:06:21,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2021-12-21 18:06:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 98 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2021-12-21 18:06:21,335 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 20 [2021-12-21 18:06:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:21,335 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2021-12-21 18:06:21,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2021-12-21 18:06:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 18:06:21,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:21,336 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] [2021-12-21 18:06:21,345 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:06:21,545 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:06:21,545 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 379593084, now seen corresponding path program 1 times [2021-12-21 18:06:21,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:21,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471034230] [2021-12-21 18:06:21,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:21,546 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:21,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:21,547 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:06:21,550 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:06:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:21,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:06:21,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:21,708 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:06:21,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:21,708 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:21,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471034230] [2021-12-21 18:06:21,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471034230] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:21,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:21,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:06:21,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580543194] [2021-12-21 18:06:21,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:21,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:06:21,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:21,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:06:21,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:06:21,710 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:22,011 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2021-12-21 18:06:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:06:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-21 18:06:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:22,012 INFO L225 Difference]: With dead ends: 120 [2021-12-21 18:06:22,012 INFO L226 Difference]: Without dead ends: 120 [2021-12-21 18:06:22,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:06:22,013 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 282 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:22,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 114 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:06:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-21 18:06:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2021-12-21 18:06:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-12-21 18:06:22,016 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 21 [2021-12-21 18:06:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:22,016 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-12-21 18:06:22,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-12-21 18:06:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 18:06:22,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:22,017 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] [2021-12-21 18:06:22,026 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:06:22,226 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:06:22,226 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:22,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash 379593085, now seen corresponding path program 1 times [2021-12-21 18:06:22,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:22,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113504470] [2021-12-21 18:06:22,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:22,227 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:22,228 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:06:22,229 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:06:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:22,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:06:22,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:22,463 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:06:22,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:22,463 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:22,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113504470] [2021-12-21 18:06:22,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113504470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:22,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:22,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:06:22,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102362059] [2021-12-21 18:06:22,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:22,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:06:22,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:22,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:06:22,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:06:22,465 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:22,793 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-12-21 18:06:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:06:22,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-21 18:06:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:22,795 INFO L225 Difference]: With dead ends: 91 [2021-12-21 18:06:22,795 INFO L226 Difference]: Without dead ends: 91 [2021-12-21 18:06:22,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:06:22,795 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 264 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:22,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 74 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:06:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-21 18:06:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-21 18:06:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-12-21 18:06:22,798 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 21 [2021-12-21 18:06:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:22,798 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-12-21 18:06:22,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-12-21 18:06:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:06:22,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:22,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:22,811 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:06:23,008 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:06:23,008 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1117536095, now seen corresponding path program 1 times [2021-12-21 18:06:23,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:23,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959105873] [2021-12-21 18:06:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:23,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:23,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:23,011 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:06:23,011 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:06:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:23,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:06:23,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:23,158 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 12 treesize of output 10 [2021-12-21 18:06:23,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:06:23,195 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:06:23,195 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:06:23,231 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 18:06:23,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:06:23,360 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:23,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2021-12-21 18:06:23,416 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:23,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-21 18:06:23,568 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:23,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2021-12-21 18:06:23,601 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:23,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-21 18:06:23,757 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 18:06:23,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2021-12-21 18:06:23,807 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:06:23,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:23,807 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959105873] [2021-12-21 18:06:23,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959105873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:23,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:23,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-21 18:06:23,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218081081] [2021-12-21 18:06:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:23,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 18:06:23,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:23,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 18:06:23,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:06:23,809 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:25,654 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-12-21 18:06:25,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:06:25,655 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-21 18:06:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:25,655 INFO L225 Difference]: With dead ends: 154 [2021-12-21 18:06:25,655 INFO L226 Difference]: Without dead ends: 154 [2021-12-21 18:06:25,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2021-12-21 18:06:25,656 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 354 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:25,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 592 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-21 18:06:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-21 18:06:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 91. [2021-12-21 18:06:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 90 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-21 18:06:25,659 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 22 [2021-12-21 18:06:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:25,659 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-21 18:06:25,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-21 18:06:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:06:25,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:25,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:25,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-21 18:06:25,870 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:06:25,871 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1117536094, now seen corresponding path program 1 times [2021-12-21 18:06:25,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:25,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807091054] [2021-12-21 18:06:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:25,872 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:25,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:25,873 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:06:25,874 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:06:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:26,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-21 18:06:26,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:26,034 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 12 treesize of output 10 [2021-12-21 18:06:26,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:06:26,074 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:06:26,075 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:06:26,106 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-21 18:06:26,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:06:26,118 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 6 treesize of output 5 [2021-12-21 18:06:26,284 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:26,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-12-21 18:06:26,290 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 46 treesize of output 42 [2021-12-21 18:06:26,399 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:26,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2021-12-21 18:06:26,404 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 69 treesize of output 61 [2021-12-21 18:06:26,727 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:26,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2021-12-21 18:06:26,734 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 56 treesize of output 50 [2021-12-21 18:06:26,792 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:06:26,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-21 18:06:26,798 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 56 treesize of output 50 [2021-12-21 18:06:27,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:06:27,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2021-12-21 18:06:27,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2021-12-21 18:06:27,433 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:06:27,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:27,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:27,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807091054] [2021-12-21 18:06:27,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807091054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:27,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:27,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-21 18:06:27,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19757501] [2021-12-21 18:06:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:27,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 18:06:27,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:27,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 18:06:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:06:27,435 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:32,648 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-12-21 18:06:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:06:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-21 18:06:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:32,649 INFO L225 Difference]: With dead ends: 149 [2021-12-21 18:06:32,649 INFO L226 Difference]: Without dead ends: 149 [2021-12-21 18:06:32,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2021-12-21 18:06:32,650 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 366 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:32,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 506 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-21 18:06:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-21 18:06:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 100. [2021-12-21 18:06:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.5) internal successors, (111), 99 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2021-12-21 18:06:32,654 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 22 [2021-12-21 18:06:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:32,654 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-12-21 18:06:32,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2021-12-21 18:06:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 18:06:32,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:32,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:32,668 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:06:32,866 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:06:32,866 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-21 18:06:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:06:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash -191213837, now seen corresponding path program 1 times [2021-12-21 18:06:32,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:06:32,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399895349] [2021-12-21 18:06:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:06:32,867 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:06:32,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:06:32,868 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:06:32,869 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:06:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:06:32,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:06:32,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:06:33,293 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:06:33,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:06:33,294 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:06:33,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399895349] [2021-12-21 18:06:33,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399895349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:06:33,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:06:33,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:06:33,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629779766] [2021-12-21 18:06:33,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:06:33,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:06:33,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:06:33,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:06:33,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:06:33,295 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:06:33,301 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2021-12-21 18:06:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:06:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-21 18:06:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:06:33,303 INFO L225 Difference]: With dead ends: 106 [2021-12-21 18:06:33,303 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 18:06:33,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:06:33,304 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:06:33,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 344 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2021-12-21 18:06:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 18:06:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2021-12-21 18:06:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.481012658227848) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-21 18:06:33,306 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2021-12-21 18:06:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:06:33,306 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-21 18:06:33,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:06:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-21 18:06:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 18:06:33,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:06:33,307 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:06:33,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0