./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 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/list-simple/sll2c_update_all.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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:16:53,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:16:53,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:16:53,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:16:53,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:16:53,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:16:53,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:16:53,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:16:53,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:16:53,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:16:53,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:16:53,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:16:53,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:16:53,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:16:53,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:16:53,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:16:53,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:16:53,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:16:53,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:16:53,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:16:53,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:16:53,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:16:53,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:16:53,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:16:53,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:16:53,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:16:53,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:16:53,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:16:53,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:16:53,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:16:53,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:16:53,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:16:53,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:16:53,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:16:53,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:16:53,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:16:53,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:16:53,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:16:53,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:16:53,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:16:53,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:16:53,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 00:16:53,662 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:16:53,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:16:53,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:16:53,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:16:53,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:16:53,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:16:53,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:16:53,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:16:53,664 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:16:53,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:16:53,665 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:16:53,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:16:53,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:16:53,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:16:53,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:16:53,666 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:16:53,666 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:16:53,666 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:16:53,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:16:53,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:16:53,666 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:16:53,666 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:16:53,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:16:53,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:16:53,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:16:53,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:16:53,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:16:53,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:16:53,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 00:16:53,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 00:16:53,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:16:53,669 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2021-12-22 00:16:53,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:16:53,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:16:53,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:16:53,881 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:16:53,882 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:16:53,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-22 00:16:53,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a61ce71/20c8586d51044a0491164dcbee77e422/FLAG963e0f62f [2021-12-22 00:16:54,345 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:16:54,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-22 00:16:54,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a61ce71/20c8586d51044a0491164dcbee77e422/FLAG963e0f62f [2021-12-22 00:16:54,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a61ce71/20c8586d51044a0491164dcbee77e422 [2021-12-22 00:16:54,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:16:54,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:16:54,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:16:54,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:16:54,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:16:54,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635c8539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54, skipping insertion in model container [2021-12-22 00:16:54,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:16:54,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:16:54,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-22 00:16:54,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:16:54,641 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:16:54,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-22 00:16:54,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:16:54,702 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:16:54,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54 WrapperNode [2021-12-22 00:16:54,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:16:54,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:16:54,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:16:54,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:16:54,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,737 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-22 00:16:54,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:16:54,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:16:54,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:16:54,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:16:54,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:16:54,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:16:54,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:16:54,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:16:54,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (1/1) ... [2021-12-22 00:16:54,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:16:54,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:16:54,799 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-22 00:16:54,801 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-22 00:16:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 00:16:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 00:16:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-22 00:16:54,830 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-22 00:16:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:16:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:16:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:16:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:16:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:16:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 00:16:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:16:54,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:16:54,958 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:16:54,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:16:55,212 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:16:55,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:16:55,216 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-22 00:16:55,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:16:55 BoogieIcfgContainer [2021-12-22 00:16:55,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:16:55,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:16:55,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:16:55,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:16:55,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:16:54" (1/3) ... [2021-12-22 00:16:55,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be673d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:16:55, skipping insertion in model container [2021-12-22 00:16:55,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:16:54" (2/3) ... [2021-12-22 00:16:55,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be673d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:16:55, skipping insertion in model container [2021-12-22 00:16:55,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:16:55" (3/3) ... [2021-12-22 00:16:55,245 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-22 00:16:55,248 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:16:55,249 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-22 00:16:55,297 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:16:55,304 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-22 00:16:55,304 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-22 00:16:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 00:16:55,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:55,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 00:16:55,328 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-22 00:16:55,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:55,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699943677] [2021-12-22 00:16:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:55,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:55,486 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-22 00:16:55,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:55,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699943677] [2021-12-22 00:16:55,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699943677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:55,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:55,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:16:55,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201900833] [2021-12-22 00:16:55,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:55,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:16:55,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:16:55,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:16:55,515 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:16:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:55,583 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-22 00:16:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:16:55,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-22 00:16:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:55,592 INFO L225 Difference]: With dead ends: 81 [2021-12-22 00:16:55,592 INFO L226 Difference]: Without dead ends: 78 [2021-12-22 00:16:55,594 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-22 00:16:55,596 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:55,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:16:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-22 00:16:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-22 00:16:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-22 00:16:55,627 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-22 00:16:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:55,628 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-22 00:16:55,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:16:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-22 00:16:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 00:16:55,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:55,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 00:16:55,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 00:16:55,629 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-22 00:16:55,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:55,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155550950] [2021-12-22 00:16:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:55,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:55,696 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-22 00:16:55,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:55,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155550950] [2021-12-22 00:16:55,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155550950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:55,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:55,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:16:55,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861916757] [2021-12-22 00:16:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:55,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:16:55,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:55,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:16:55,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:16:55,702 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:16:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:55,750 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-22 00:16:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:16:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-22 00:16:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:55,755 INFO L225 Difference]: With dead ends: 76 [2021-12-22 00:16:55,755 INFO L226 Difference]: Without dead ends: 76 [2021-12-22 00:16:55,757 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-22 00:16:55,758 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:55,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:16:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-22 00:16:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-22 00:16:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-22 00:16:55,765 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-22 00:16:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:55,767 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-22 00:16:55,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:16:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-22 00:16:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 00:16:55,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:55,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:16:55,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 00:16:55,769 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-22 00:16:55,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:55,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997096446] [2021-12-22 00:16:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:55,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:55,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:55,849 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-22 00:16:55,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:55,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997096446] [2021-12-22 00:16:55,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997096446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:55,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:55,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:16:55,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137594045] [2021-12-22 00:16:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:55,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:16:55,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:55,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:16:55,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:16:55,853 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 00:16:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:55,919 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-22 00:16:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:16:55,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-22 00:16:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:55,920 INFO L225 Difference]: With dead ends: 83 [2021-12-22 00:16:55,920 INFO L226 Difference]: Without dead ends: 83 [2021-12-22 00:16:55,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:16:55,921 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:55,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:16:55,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-22 00:16:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-22 00:16:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-22 00:16:55,927 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-22 00:16:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:55,927 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-22 00:16:55,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 00:16:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-22 00:16:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 00:16:55,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:55,928 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:16:55,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 00:16:55,929 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-22 00:16:55,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:55,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637630395] [2021-12-22 00:16:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:55,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 00:16:56,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:56,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637630395] [2021-12-22 00:16:56,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637630395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:56,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:56,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 00:16:56,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919806668] [2021-12-22 00:16:56,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:56,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:16:56,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:16:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:16:56,007 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:56,113 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-22 00:16:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:16:56,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-22 00:16:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:56,116 INFO L225 Difference]: With dead ends: 97 [2021-12-22 00:16:56,116 INFO L226 Difference]: Without dead ends: 97 [2021-12-22 00:16:56,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:16:56,117 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:56,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:16:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-22 00:16:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-22 00:16:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-22 00:16:56,122 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-22 00:16:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:56,123 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-22 00:16:56,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-22 00:16:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 00:16:56,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:56,124 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:16:56,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 00:16:56,124 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-22 00:16:56,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:56,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628722499] [2021-12-22 00:16:56,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:56,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:16:56,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:56,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628722499] [2021-12-22 00:16:56,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628722499] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:56,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:56,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 00:16:56,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421738638] [2021-12-22 00:16:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:56,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:16:56,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:56,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:16:56,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:16:56,231 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:56,325 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-22 00:16:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:16:56,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-22 00:16:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:56,327 INFO L225 Difference]: With dead ends: 76 [2021-12-22 00:16:56,327 INFO L226 Difference]: Without dead ends: 76 [2021-12-22 00:16:56,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:16:56,328 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:56,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:16:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-22 00:16:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-22 00:16:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-22 00:16:56,332 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-22 00:16:56,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:56,332 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-22 00:16:56,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-22 00:16:56,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 00:16:56,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:56,333 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:16:56,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 00:16:56,334 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-22 00:16:56,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:56,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396606218] [2021-12-22 00:16:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:56,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:56,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 00:16:56,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:56,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396606218] [2021-12-22 00:16:56,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396606218] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:16:56,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015462748] [2021-12-22 00:16:56,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:56,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:16:56,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:16:56,455 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-22 00:16:56,456 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-22 00:16:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:56,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 00:16:56,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:16:56,598 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-22 00:16:56,721 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-22 00:16:56,722 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 17 treesize of output 21 [2021-12-22 00:16:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:16:56,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:16:56,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015462748] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:16:56,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:16:56,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-22 00:16:56,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141542325] [2021-12-22 00:16:56,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:16:56,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:16:56,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:16:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:16:56,811 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:16:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:56,907 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-22 00:16:56,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:16:56,907 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-22 00:16:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:56,908 INFO L225 Difference]: With dead ends: 94 [2021-12-22 00:16:56,908 INFO L226 Difference]: Without dead ends: 94 [2021-12-22 00:16:56,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:16:56,908 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:56,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2021-12-22 00:16:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-22 00:16:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2021-12-22 00:16:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-12-22 00:16:56,912 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2021-12-22 00:16:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:56,912 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-12-22 00:16:56,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:16:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-12-22 00:16:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 00:16:56,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:56,913 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:16:56,945 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-22 00:16:57,123 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,SelfDestructingSolverStorable5 [2021-12-22 00:16:57,124 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-22 00:16:57,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:57,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515538681] [2021-12-22 00:16:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:57,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:57,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:16:57,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:57,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515538681] [2021-12-22 00:16:57,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515538681] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:16:57,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691464255] [2021-12-22 00:16:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:57,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:16:57,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:16:57,304 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-22 00:16:57,304 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-22 00:16:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:57,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-22 00:16:57,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:16:57,401 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-22 00:16:57,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:16:57,639 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 14 treesize of output 16 [2021-12-22 00:16:57,646 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:16:57,646 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-22 00:16:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:16:57,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:16:57,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691464255] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:16:57,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:16:57,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-22 00:16:57,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106578956] [2021-12-22 00:16:57,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:16:57,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 00:16:57,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 00:16:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-22 00:16:57,788 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-22 00:16:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:58,007 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-12-22 00:16:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:16:58,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-12-22 00:16:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:58,011 INFO L225 Difference]: With dead ends: 94 [2021-12-22 00:16:58,011 INFO L226 Difference]: Without dead ends: 94 [2021-12-22 00:16:58,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-12-22 00:16:58,012 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 176 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:58,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 450 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2021-12-22 00:16:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-22 00:16:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2021-12-22 00:16:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2021-12-22 00:16:58,016 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2021-12-22 00:16:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:58,017 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2021-12-22 00:16:58,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-22 00:16:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2021-12-22 00:16:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:16:58,018 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:58,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:16:58,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-22 00:16:58,231 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,SelfDestructingSolverStorable6 [2021-12-22 00:16:58,232 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-22 00:16:58,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:58,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464306445] [2021-12-22 00:16:58,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:58,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:58,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:58,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 00:16:58,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:58,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464306445] [2021-12-22 00:16:58,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464306445] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:58,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:58,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:16:58,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244736322] [2021-12-22 00:16:58,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:58,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:16:58,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:58,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:16:58,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:16:58,342 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:58,586 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-22 00:16:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:16:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-22 00:16:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:58,588 INFO L225 Difference]: With dead ends: 142 [2021-12-22 00:16:58,588 INFO L226 Difference]: Without dead ends: 142 [2021-12-22 00:16:58,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:16:58,589 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:58,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:16:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-22 00:16:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2021-12-22 00:16:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-12-22 00:16:58,593 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2021-12-22 00:16:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:58,593 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-12-22 00:16:58,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-12-22 00:16:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:16:58,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:58,594 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:16:58,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 00:16:58,595 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:58,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2021-12-22 00:16:58,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:58,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291674482] [2021-12-22 00:16:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:58,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:58,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:16:58,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291674482] [2021-12-22 00:16:58,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291674482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:58,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:58,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:16:58,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574959658] [2021-12-22 00:16:58,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:58,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:16:58,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:58,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:16:58,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:16:58,701 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:58,923 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2021-12-22 00:16:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:16:58,924 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-22 00:16:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:58,925 INFO L225 Difference]: With dead ends: 123 [2021-12-22 00:16:58,925 INFO L226 Difference]: Without dead ends: 123 [2021-12-22 00:16:58,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:16:58,925 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 323 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:58,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 485 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:16:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-22 00:16:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2021-12-22 00:16:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2021-12-22 00:16:58,929 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 30 [2021-12-22 00:16:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:58,929 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2021-12-22 00:16:58,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2021-12-22 00:16:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 00:16:58,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:58,930 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 00:16:58,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 00:16:58,930 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:58,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2021-12-22 00:16:58,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:58,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063202876] [2021-12-22 00:16:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:58,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:16:59,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:59,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063202876] [2021-12-22 00:16:59,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063202876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:59,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:59,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:16:59,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60142685] [2021-12-22 00:16:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:59,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:16:59,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:59,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:16:59,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:16:59,007 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:59,059 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2021-12-22 00:16:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:16:59,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-22 00:16:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:59,060 INFO L225 Difference]: With dead ends: 155 [2021-12-22 00:16:59,060 INFO L226 Difference]: Without dead ends: 155 [2021-12-22 00:16:59,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:16:59,061 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 87 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:59,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 297 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:16:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-22 00:16:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 78. [2021-12-22 00:16:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.509090909090909) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2021-12-22 00:16:59,064 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 32 [2021-12-22 00:16:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:59,065 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2021-12-22 00:16:59,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2021-12-22 00:16:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 00:16:59,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:59,066 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 00:16:59,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 00:16:59,066 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333233, now seen corresponding path program 1 times [2021-12-22 00:16:59,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:59,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778789572] [2021-12-22 00:16:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:59,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 00:16:59,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:59,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778789572] [2021-12-22 00:16:59,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778789572] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:59,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:59,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:16:59,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971396868] [2021-12-22 00:16:59,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:59,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:16:59,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:59,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:16:59,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:16:59,149 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:59,338 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2021-12-22 00:16:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:16:59,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-22 00:16:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:59,340 INFO L225 Difference]: With dead ends: 130 [2021-12-22 00:16:59,340 INFO L226 Difference]: Without dead ends: 130 [2021-12-22 00:16:59,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:16:59,340 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 296 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:59,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 412 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:16:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-22 00:16:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2021-12-22 00:16:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 77 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2021-12-22 00:16:59,343 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 32 [2021-12-22 00:16:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:59,344 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2021-12-22 00:16:59,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2021-12-22 00:16:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 00:16:59,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:59,345 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 00:16:59,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 00:16:59,345 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:59,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:59,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333232, now seen corresponding path program 1 times [2021-12-22 00:16:59,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:59,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753292921] [2021-12-22 00:16:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:59,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-22 00:16:59,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:59,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753292921] [2021-12-22 00:16:59,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753292921] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:16:59,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638806432] [2021-12-22 00:16:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:59,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:16:59,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:16:59,398 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-22 00:16:59,399 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-22 00:16:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 00:16:59,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:16:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:16:59,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:16:59,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638806432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:59,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 00:16:59,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-12-22 00:16:59,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634106040] [2021-12-22 00:16:59,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:59,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:16:59,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:59,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:16:59,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:16:59,551 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:59,564 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2021-12-22 00:16:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:16:59,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-22 00:16:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:59,565 INFO L225 Difference]: With dead ends: 103 [2021-12-22 00:16:59,565 INFO L226 Difference]: Without dead ends: 103 [2021-12-22 00:16:59,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:16:59,566 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:59,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 141 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:16:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-22 00:16:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2021-12-22 00:16:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 78 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2021-12-22 00:16:59,569 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 32 [2021-12-22 00:16:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:59,570 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2021-12-22 00:16:59,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2021-12-22 00:16:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 00:16:59,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:59,571 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 00:16:59,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-22 00:16:59,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:16:59,780 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-22 00:16:59,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:59,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918689336] [2021-12-22 00:16:59,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:59,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:16:59,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:59,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918689336] [2021-12-22 00:16:59,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918689336] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:16:59,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:16:59,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:16:59,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766356276] [2021-12-22 00:16:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:16:59,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:16:59,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:16:59,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:16:59,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:16:59,844 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:16:59,896 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2021-12-22 00:16:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:16:59,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-22 00:16:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:16:59,898 INFO L225 Difference]: With dead ends: 150 [2021-12-22 00:16:59,898 INFO L226 Difference]: Without dead ends: 150 [2021-12-22 00:16:59,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:16:59,899 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 80 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:16:59,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 258 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:16:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-22 00:16:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2021-12-22 00:16:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5) internal successors, (90), 79 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:16:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-22 00:16:59,901 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 33 [2021-12-22 00:16:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:16:59,901 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-22 00:16:59,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:16:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-22 00:16:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:16:59,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:16:59,905 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 00:16:59,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 00:16:59,905 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:16:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:16:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash 274321452, now seen corresponding path program 1 times [2021-12-22 00:16:59,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:16:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259243282] [2021-12-22 00:16:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:59,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:16:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:16:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:16:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:16:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-22 00:16:59,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:16:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259243282] [2021-12-22 00:16:59,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259243282] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:16:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731390111] [2021-12-22 00:16:59,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:16:59,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:16:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:17:00,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:17:00,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 00:17:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:00,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:17:00,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:17:00,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:17:00,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731390111] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:17:00,260 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:17:00,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-22 00:17:00,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962597634] [2021-12-22 00:17:00,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:00,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:17:00,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:17:00,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:17:00,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:17:00,261 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 00:17:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:00,334 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2021-12-22 00:17:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:17:00,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2021-12-22 00:17:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:00,335 INFO L225 Difference]: With dead ends: 130 [2021-12-22 00:17:00,335 INFO L226 Difference]: Without dead ends: 130 [2021-12-22 00:17:00,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:17:00,336 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 145 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:00,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 355 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:17:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-22 00:17:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2021-12-22 00:17:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2021-12-22 00:17:00,339 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 37 [2021-12-22 00:17:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:00,339 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2021-12-22 00:17:00,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 00:17:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2021-12-22 00:17:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 00:17:00,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:00,340 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-12-22 00:17:00,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-22 00:17:00,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:17:00,552 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:00,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:00,553 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2021-12-22 00:17:00,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:17:00,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860531111] [2021-12-22 00:17:00,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:00,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:17:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:00,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:17:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:17:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:00,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:17:00,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860531111] [2021-12-22 00:17:00,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860531111] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:00,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990272350] [2021-12-22 00:17:00,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:00,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:17:00,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:17:00,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:17:00,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 00:17:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:01,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-22 00:17:01,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:01,022 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-22 00:17:01,094 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:17:01,094 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-22 00:17:01,107 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-22 00:17:01,163 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:17:01,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-22 00:17:01,326 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-22 00:17:01,327 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 31 treesize of output 32 [2021-12-22 00:17:01,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:17:01,529 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:01,529 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 25 treesize of output 16 [2021-12-22 00:17:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:17:01,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:04,476 INFO L353 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2021-12-22 00:17:04,476 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 24 treesize of output 23 [2021-12-22 00:17:04,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1039 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| 4) v_ArrVal_1039) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (<= 0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)))) is different from false [2021-12-22 00:17:04,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1039 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) (not (<= 0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| 4) v_ArrVal_1039) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|))) is different from false [2021-12-22 00:17:04,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:04,580 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-22 00:17:04,585 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 40 treesize of output 36 [2021-12-22 00:17:04,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:17:04,589 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 9 treesize of output 7 [2021-12-22 00:17:04,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:17:04,595 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:04,595 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 17 treesize of output 21 [2021-12-22 00:17:04,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990272350] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:04,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:04,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2021-12-22 00:17:04,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885451477] [2021-12-22 00:17:04,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:04,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-22 00:17:04,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:17:04,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-22 00:17:04,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1304, Unknown=5, NotChecked=146, Total=1560 [2021-12-22 00:17:04,788 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:05,526 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2021-12-22 00:17:05,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 00:17:05,527 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2021-12-22 00:17:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:05,528 INFO L225 Difference]: With dead ends: 173 [2021-12-22 00:17:05,528 INFO L226 Difference]: Without dead ends: 173 [2021-12-22 00:17:05,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=214, Invalid=2045, Unknown=5, NotChecked=186, Total=2450 [2021-12-22 00:17:05,529 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 102 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:05,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 2082 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1090 Invalid, 0 Unknown, 129 Unchecked, 0.4s Time] [2021-12-22 00:17:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-22 00:17:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2021-12-22 00:17:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 108 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 00:17:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2021-12-22 00:17:05,532 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 38 [2021-12-22 00:17:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:05,532 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2021-12-22 00:17:05,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2021-12-22 00:17:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 00:17:05,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:05,533 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-12-22 00:17:05,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:05,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-22 00:17:05,743 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2021-12-22 00:17:05,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:17:05,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637225874] [2021-12-22 00:17:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:05,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:17:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:06,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 00:17:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 00:17:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:06,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:17:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637225874] [2021-12-22 00:17:06,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637225874] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625450911] [2021-12-22 00:17:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:06,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:17:06,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:17:06,158 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:17:06,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 00:17:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:06,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-22 00:17:06,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:06,312 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-22 00:17:06,592 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:17:06,592 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-22 00:17:06,608 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 138567 column 46: unknown constant v_#length_BEFORE_CALL_4 [2021-12-22 00:17:06,609 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-22 00:17:06,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-12-22 00:17:06,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391133520] [2021-12-22 00:17:06,609 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:06,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-22 00:17:06,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:17:06,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-22 00:17:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2021-12-22 00:17:06,610 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 00:17:06,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2021-12-22 00:17:06,611 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-22 00:17:06,611 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-22 00:17:06,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:06,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-22 00:17:06,812 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.modelcheckerutils.smt.MonolithicImplicationChecker@320aa1d7 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-22 00:17:06,816 INFO L158 Benchmark]: Toolchain (without parser) took 12451.02ms. Allocated memory was 107.0MB in the beginning and 159.4MB in the end (delta: 52.4MB). Free memory was 69.4MB in the beginning and 43.4MB in the end (delta: 26.0MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2021-12-22 00:17:06,816 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:17:06,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.50ms. Allocated memory is still 107.0MB. Free memory was 69.2MB in the beginning and 76.1MB in the end (delta: -6.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 00:17:06,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.10ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 74.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:17:06,816 INFO L158 Benchmark]: Boogie Preprocessor took 24.90ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 72.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:17:06,817 INFO L158 Benchmark]: RCFGBuilder took 466.68ms. Allocated memory is still 107.0MB. Free memory was 71.9MB in the beginning and 55.8MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-22 00:17:06,817 INFO L158 Benchmark]: TraceAbstraction took 11583.57ms. Allocated memory was 107.0MB in the beginning and 159.4MB in the end (delta: 52.4MB). Free memory was 55.2MB in the beginning and 43.4MB in the end (delta: 11.7MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2021-12-22 00:17:06,818 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.50ms. Allocated memory is still 107.0MB. Free memory was 69.2MB in the beginning and 76.1MB in the end (delta: -6.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.10ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 74.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.90ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 72.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 466.68ms. Allocated memory is still 107.0MB. Free memory was 71.9MB in the beginning and 55.8MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11583.57ms. Allocated memory was 107.0MB in the beginning and 159.4MB in the end (delta: 52.4MB). Free memory was 55.2MB in the beginning and 43.4MB in the end (delta: 11.7MB). Peak memory consumption was 65.6MB. 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.modelcheckerutils.smt.MonolithicImplicationChecker@320aa1d7 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@320aa1d7: 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-22 00:17:06,856 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 1 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/list-simple/sll2c_update_all.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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:17:08,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:17:08,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:17:08,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:17:08,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:17:08,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:17:08,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:17:08,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:17:08,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:17:08,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:17:08,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:17:08,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:17:08,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:17:08,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:17:08,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:17:08,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:17:08,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:17:08,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:17:08,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:17:08,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:17:08,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:17:08,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:17:08,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:17:08,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:17:08,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:17:08,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:17:08,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:17:08,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:17:08,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:17:08,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:17:08,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:17:08,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:17:08,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:17:08,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:17:08,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:17:08,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:17:08,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:17:08,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:17:08,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:17:08,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:17:08,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:17:08,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-22 00:17:08,741 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:17:08,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:17:08,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:17:08,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:17:08,743 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:17:08,743 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:17:08,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:17:08,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:17:08,743 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:17:08,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:17:08,744 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:17:08,745 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:17:08,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:17:08,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:17:08,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:17:08,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:17:08,745 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:17:08,746 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:17:08,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:17:08,746 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:17:08,746 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-22 00:17:08,746 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-22 00:17:08,746 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:17:08,747 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:17:08,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:17:08,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:17:08,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:17:08,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:17:08,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:17:08,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:17:08,748 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-22 00:17:08,748 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-22 00:17:08,748 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:17:08,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-22 00:17:08,749 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2021-12-22 00:17:09,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:17:09,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:17:09,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:17:09,065 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:17:09,065 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:17:09,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-22 00:17:09,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b65ebb0/d21a5106d70e42fc933fb6e6a44e4445/FLAGd8f153b3c [2021-12-22 00:17:09,502 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:17:09,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-22 00:17:09,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b65ebb0/d21a5106d70e42fc933fb6e6a44e4445/FLAGd8f153b3c [2021-12-22 00:17:09,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b65ebb0/d21a5106d70e42fc933fb6e6a44e4445 [2021-12-22 00:17:09,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:17:09,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:17:09,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:17:09,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:17:09,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:17:09,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c10f41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09, skipping insertion in model container [2021-12-22 00:17:09,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:17:09,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:17:09,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-22 00:17:09,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:17:09,832 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:17:09,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-22 00:17:09,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:17:09,895 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:17:09,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09 WrapperNode [2021-12-22 00:17:09,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:17:09,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:17:09,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:17:09,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:17:09,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,944 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-22 00:17:09,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:17:09,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:17:09,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:17:09,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:17:09,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:09,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:17:09,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:17:09,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:17:09,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:17:09,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (1/1) ... [2021-12-22 00:17:10,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:17:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:17:10,036 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-22 00:17:10,038 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-22 00:17:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-22 00:17:10,071 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-22 00:17:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-22 00:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:17:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:17:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-22 00:17:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-22 00:17:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:17:10,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:17:10,215 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:17:10,216 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:17:10,526 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:17:10,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:17:10,532 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-22 00:17:10,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:17:10 BoogieIcfgContainer [2021-12-22 00:17:10,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:17:10,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:17:10,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:17:10,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:17:10,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:17:09" (1/3) ... [2021-12-22 00:17:10,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a69473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:17:10, skipping insertion in model container [2021-12-22 00:17:10,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:17:09" (2/3) ... [2021-12-22 00:17:10,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a69473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:17:10, skipping insertion in model container [2021-12-22 00:17:10,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:17:10" (3/3) ... [2021-12-22 00:17:10,538 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-22 00:17:10,541 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:17:10,541 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-22 00:17:10,570 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:17:10,574 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-22 00:17:10,574 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-22 00:17:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 00:17:10,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:10,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 00:17:10,587 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-22 00:17:10,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:10,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367487138] [2021-12-22 00:17:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:10,598 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:10,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:10,600 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-22 00:17:10,601 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-22 00:17:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:10,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 00:17:10,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:10,701 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-22 00:17:10,709 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-22 00:17:10,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:10,710 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:10,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367487138] [2021-12-22 00:17:10,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367487138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:10,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:10,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:17:10,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025481537] [2021-12-22 00:17:10,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:10,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:17:10,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:17:10,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:17:10,736 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:17:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:10,817 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-22 00:17:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:17:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-22 00:17:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:10,823 INFO L225 Difference]: With dead ends: 81 [2021-12-22 00:17:10,823 INFO L226 Difference]: Without dead ends: 78 [2021-12-22 00:17:10,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-22 00:17:10,826 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:10,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:17:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-22 00:17:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-22 00:17:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-22 00:17:10,850 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-22 00:17:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:10,850 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-22 00:17:10,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:17:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-22 00:17:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 00:17:10,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:10,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 00:17:10,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-22 00:17:11,057 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-22 00:17:11,057 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-22 00:17:11,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:11,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101416187] [2021-12-22 00:17:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:11,060 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:11,063 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-22 00:17:11,068 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-22 00:17:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:11,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:17:11,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:11,131 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-22 00:17:11,159 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-22 00:17:11,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:11,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:11,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101416187] [2021-12-22 00:17:11,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101416187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:11,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:11,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:17:11,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034500123] [2021-12-22 00:17:11,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:11,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:17:11,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:17:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:17:11,162 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:17:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:11,245 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-22 00:17:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:17:11,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-22 00:17:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:11,247 INFO L225 Difference]: With dead ends: 76 [2021-12-22 00:17:11,247 INFO L226 Difference]: Without dead ends: 76 [2021-12-22 00:17:11,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-22 00:17:11,248 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:11,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:17:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-22 00:17:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-22 00:17:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-22 00:17:11,255 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-22 00:17:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:11,255 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-22 00:17:11,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:17:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-22 00:17:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 00:17:11,256 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:11,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:11,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-22 00:17:11,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-22 00:17:11,462 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-22 00:17:11,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:11,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020664941] [2021-12-22 00:17:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:11,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:11,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:11,465 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-22 00:17:11,467 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-22 00:17:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:11,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:17:11,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:11,547 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-22 00:17:11,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:11,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:11,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020664941] [2021-12-22 00:17:11,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020664941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:11,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:11,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:17:11,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509023111] [2021-12-22 00:17:11,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:11,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:17:11,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:11,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:17:11,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:17:11,549 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 00:17:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:11,558 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-22 00:17:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:17:11,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-22 00:17:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:11,560 INFO L225 Difference]: With dead ends: 83 [2021-12-22 00:17:11,560 INFO L226 Difference]: Without dead ends: 83 [2021-12-22 00:17:11,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-22 00:17:11,561 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:11,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:17:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-22 00:17:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-22 00:17:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-22 00:17:11,568 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-22 00:17:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:11,569 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-22 00:17:11,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 00:17:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-22 00:17:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 00:17:11,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:11,570 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:11,579 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-22 00:17:11,776 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-22 00:17:11,777 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-22 00:17:11,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:11,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484718172] [2021-12-22 00:17:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:11,778 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:11,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:11,780 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-22 00:17:11,788 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-22 00:17:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:11,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 00:17:11,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:11,877 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-22 00:17:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:11,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:11,912 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:11,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484718172] [2021-12-22 00:17:11,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484718172] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:11,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:11,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:17:11,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324393910] [2021-12-22 00:17:11,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:11,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:17:11,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:17:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:17:11,914 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:12,078 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-22 00:17:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:17:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-22 00:17:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:12,080 INFO L225 Difference]: With dead ends: 97 [2021-12-22 00:17:12,081 INFO L226 Difference]: Without dead ends: 97 [2021-12-22 00:17:12,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:17:12,082 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:12,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:17:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-22 00:17:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-22 00:17:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-22 00:17:12,086 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-22 00:17:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:12,087 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-22 00:17:12,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-22 00:17:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 00:17:12,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:12,088 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:12,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-22 00:17:12,288 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-22 00:17:12,288 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-22 00:17:12,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:12,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334150079] [2021-12-22 00:17:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:12,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:12,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:12,291 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-22 00:17:12,292 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-22 00:17:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:12,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 00:17:12,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:12,382 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-22 00:17:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:12,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:12,477 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:12,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334150079] [2021-12-22 00:17:12,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334150079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:12,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:12,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:17:12,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135850179] [2021-12-22 00:17:12,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:12,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:17:12,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:12,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:17:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:17:12,479 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:12,627 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-22 00:17:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:17:12,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-22 00:17:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:12,628 INFO L225 Difference]: With dead ends: 76 [2021-12-22 00:17:12,629 INFO L226 Difference]: Without dead ends: 76 [2021-12-22 00:17:12,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:17:12,629 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:12,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:17:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-22 00:17:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-22 00:17:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-22 00:17:12,633 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-22 00:17:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:12,633 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-22 00:17:12,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-22 00:17:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 00:17:12,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:12,634 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:12,654 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-22 00:17:12,840 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-22 00:17:12,841 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-22 00:17:12,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:12,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092487608] [2021-12-22 00:17:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:12,842 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:12,843 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-22 00:17:12,844 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-22 00:17:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:12,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 00:17:12,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:12,933 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-22 00:17:13,085 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-22 00:17:13,085 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 17 treesize of output 24 [2021-12-22 00:17:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:13,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:15,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:15,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092487608] [2021-12-22 00:17:15,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092487608] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:17:15,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:15,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-12-22 00:17:15,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145639229] [2021-12-22 00:17:15,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:15,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:17:15,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:17:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2021-12-22 00:17:15,373 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:17:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:15,558 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-12-22 00:17:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:17:15,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-22 00:17:15,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:15,559 INFO L225 Difference]: With dead ends: 101 [2021-12-22 00:17:15,559 INFO L226 Difference]: Without dead ends: 101 [2021-12-22 00:17:15,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=34, Invalid=97, Unknown=1, NotChecked=0, Total=132 [2021-12-22 00:17:15,560 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:15,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 314 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2021-12-22 00:17:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-22 00:17:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2021-12-22 00:17:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-22 00:17:15,564 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2021-12-22 00:17:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:15,564 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-22 00:17:15,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:17:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-22 00:17:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 00:17:15,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:15,565 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:15,575 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-22 00:17:15,773 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-22 00:17:15,773 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-22 00:17:15,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:15,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271299900] [2021-12-22 00:17:15,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:15,774 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:15,775 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-22 00:17:15,777 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-22 00:17:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:15,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 00:17:15,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:15,876 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-22 00:17:15,879 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-22 00:17:16,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:16,160 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-22 00:17:16,168 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:17:16,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 00:17:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:17:16,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:18,419 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271299900] [2021-12-22 00:17:18,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271299900] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [530454384] [2021-12-22 00:17:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:18,420 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-22 00:17:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-22 00:17:18,422 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-22 00:17:18,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-22 00:17:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:18,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 00:17:18,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:18,576 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-22 00:17:18,581 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-22 00:17:18,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:18,762 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-22 00:17:18,771 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:17:18,771 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-22 00:17:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:17:18,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:18,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [530454384] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:18,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:18,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-22 00:17:18,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722817672] [2021-12-22 00:17:18,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:18,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:17:18,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:17:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2021-12-22 00:17:18,969 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:19,247 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2021-12-22 00:17:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:17:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-22 00:17:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:19,248 INFO L225 Difference]: With dead ends: 163 [2021-12-22 00:17:19,248 INFO L226 Difference]: Without dead ends: 163 [2021-12-22 00:17:19,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2021-12-22 00:17:19,249 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:19,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 331 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-22 00:17:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-22 00:17:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 87. [2021-12-22 00:17:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.459016393442623) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 00:17:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-22 00:17:19,253 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 25 [2021-12-22 00:17:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:19,254 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-22 00:17:19,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-22 00:17:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:17:19,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:19,255 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:19,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:19,466 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-22 00:17:19,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:17:19,658 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:19,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-22 00:17:19,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:19,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662283122] [2021-12-22 00:17:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:19,659 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:19,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:19,663 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-22 00:17:19,665 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-22 00:17:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:19,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 00:17:19,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:19,782 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-22 00:17:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:19,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:19,896 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:19,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662283122] [2021-12-22 00:17:19,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662283122] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:19,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:19,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:17:19,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444261963] [2021-12-22 00:17:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:19,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:17:19,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:17:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:17:19,897 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:20,356 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2021-12-22 00:17:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:17:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-22 00:17:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:20,357 INFO L225 Difference]: With dead ends: 155 [2021-12-22 00:17:20,358 INFO L226 Difference]: Without dead ends: 155 [2021-12-22 00:17:20,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-22 00:17:20,358 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 313 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:20,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 423 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:17:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-22 00:17:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 90. [2021-12-22 00:17:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.484375) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 00:17:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2021-12-22 00:17:20,362 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 30 [2021-12-22 00:17:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:20,362 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2021-12-22 00:17:20,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2021-12-22 00:17:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:17:20,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:20,363 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:20,370 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-22 00:17:20,570 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-22 00:17:20,570 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:20,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2021-12-22 00:17:20,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:20,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684218358] [2021-12-22 00:17:20,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:20,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:20,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:20,573 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-22 00:17:20,575 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-22 00:17:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:20,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 00:17:20,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:20,682 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-22 00:17:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:20,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:20,832 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:20,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684218358] [2021-12-22 00:17:20,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684218358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:20,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:20,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:17:20,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323390581] [2021-12-22 00:17:20,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:20,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:17:20,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:17:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:17:20,833 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:21,327 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2021-12-22 00:17:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:17:21,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-22 00:17:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:21,328 INFO L225 Difference]: With dead ends: 136 [2021-12-22 00:17:21,328 INFO L226 Difference]: Without dead ends: 136 [2021-12-22 00:17:21,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-22 00:17:21,329 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 325 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:21,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 422 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:17:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-22 00:17:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2021-12-22 00:17:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.453125) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 00:17:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2021-12-22 00:17:21,332 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 30 [2021-12-22 00:17:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:21,332 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2021-12-22 00:17:21,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2021-12-22 00:17:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 00:17:21,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:21,333 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 00:17:21,356 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-22 00:17:21,541 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-22 00:17:21,541 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2021-12-22 00:17:21,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:21,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962962014] [2021-12-22 00:17:21,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:21,542 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:21,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:21,543 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-22 00:17:21,544 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-22 00:17:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:21,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 00:17:21,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:17:21,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:21,683 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:21,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962962014] [2021-12-22 00:17:21,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962962014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:21,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:21,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:17:21,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699153191] [2021-12-22 00:17:21,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:21,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:17:21,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:17:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:17:21,684 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:21,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:21,706 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2021-12-22 00:17:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:17:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-22 00:17:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:21,708 INFO L225 Difference]: With dead ends: 119 [2021-12-22 00:17:21,708 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 00:17:21,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:17:21,708 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:21,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 143 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:17:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 00:17:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2021-12-22 00:17:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 00:17:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-12-22 00:17:21,711 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 32 [2021-12-22 00:17:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:21,711 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-12-22 00:17:21,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-12-22 00:17:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 00:17:21,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:21,712 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 00:17:21,733 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-22 00:17:21,915 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-22 00:17:21,916 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:21,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:21,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-22 00:17:21,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:21,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180124573] [2021-12-22 00:17:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:21,916 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:21,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:21,917 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-22 00:17:21,920 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-22 00:17:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:22,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:17:22,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:17:22,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:22,074 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:22,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180124573] [2021-12-22 00:17:22,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180124573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:22,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:22,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:17:22,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052526410] [2021-12-22 00:17:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:22,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:17:22,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:22,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:17:22,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:17:22,076 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:22,119 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2021-12-22 00:17:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:17:22,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-22 00:17:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:22,122 INFO L225 Difference]: With dead ends: 168 [2021-12-22 00:17:22,122 INFO L226 Difference]: Without dead ends: 168 [2021-12-22 00:17:22,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-22 00:17:22,123 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 98 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:22,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 221 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:17:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-22 00:17:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 93. [2021-12-22 00:17:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 00:17:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-12-22 00:17:22,126 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 33 [2021-12-22 00:17:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:22,126 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-12-22 00:17:22,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-12-22 00:17:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:17:22,142 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:22,142 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:22,152 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-22 00:17:22,350 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-22 00:17:22,350 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2021-12-22 00:17:22,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:22,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742272446] [2021-12-22 00:17:22,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:17:22,351 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:22,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:22,368 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-22 00:17:22,369 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-22 00:17:22,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 00:17:22,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:17:22,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 00:17:22,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-22 00:17:22,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 00:17:22,623 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:22,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742272446] [2021-12-22 00:17:22,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742272446] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:17:22,624 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:22,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-22 00:17:22,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87553978] [2021-12-22 00:17:22,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:22,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:17:22,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:17:22,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:17:22,624 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-22 00:17:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:22,635 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2021-12-22 00:17:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:17:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2021-12-22 00:17:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:22,636 INFO L225 Difference]: With dead ends: 86 [2021-12-22 00:17:22,636 INFO L226 Difference]: Without dead ends: 86 [2021-12-22 00:17:22,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:17:22,636 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 186 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:22,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 158 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:17:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-22 00:17:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-22 00:17:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-22 00:17:22,638 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 37 [2021-12-22 00:17:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:22,638 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-22 00:17:22,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-22 00:17:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-22 00:17:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 00:17:22,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:22,639 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-22 00:17:22,647 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-22 00:17:22,839 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-22 00:17:22,840 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:22,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:22,840 INFO L85 PathProgramCache]: Analyzing trace with hash 274321506, now seen corresponding path program 1 times [2021-12-22 00:17:22,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:22,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974850506] [2021-12-22 00:17:22,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:22,840 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:22,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:22,842 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-22 00:17:22,844 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-22 00:17:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:22,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:17:22,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:17:23,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:17:23,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:23,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974850506] [2021-12-22 00:17:23,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974850506] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:17:23,093 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:23,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-22 00:17:23,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918682596] [2021-12-22 00:17:23,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:23,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:17:23,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:23,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:17:23,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:17:23,094 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 00:17:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:23,139 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2021-12-22 00:17:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:17:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2021-12-22 00:17:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:23,148 INFO L225 Difference]: With dead ends: 132 [2021-12-22 00:17:23,148 INFO L226 Difference]: Without dead ends: 132 [2021-12-22 00:17:23,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:17:23,149 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 170 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:23,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 268 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:17:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-22 00:17:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2021-12-22 00:17:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 94 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-12-22 00:17:23,151 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 37 [2021-12-22 00:17:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:23,151 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-12-22 00:17:23,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 00:17:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-12-22 00:17:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 00:17:23,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:23,152 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-12-22 00:17:23,177 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-22 00:17:23,359 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-22 00:17:23,359 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2021-12-22 00:17:23,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:23,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795588217] [2021-12-22 00:17:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:23,360 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:23,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:23,361 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-22 00:17:23,362 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-22 00:17:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:23,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-22 00:17:23,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:23,542 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-22 00:17:23,645 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:17:23,645 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-22 00:17:23,691 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-22 00:17:23,757 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:17:23,757 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 28 treesize of output 29 [2021-12-22 00:17:23,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:23,900 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 31 treesize of output 26 [2021-12-22 00:17:23,968 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 25 treesize of output 13 [2021-12-22 00:17:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:24,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:26,373 INFO L353 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-22 00:17:26,373 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 19 treesize of output 18 [2021-12-22 00:17:26,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-22 00:17:26,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-22 00:17:26,416 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:26,416 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-22 00:17:26,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-22 00:17:26,424 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 9 treesize of output 7 [2021-12-22 00:17:26,638 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:26,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795588217] [2021-12-22 00:17:26,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795588217] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:26,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [752297220] [2021-12-22 00:17:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:26,638 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-22 00:17:26,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-22 00:17:26,639 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-22 00:17:26,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-12-22 00:17:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:26,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-22 00:17:26,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:26,832 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-22 00:17:27,076 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-22 00:17:27,077 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 17 treesize of output 24 [2021-12-22 00:17:27,266 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-22 00:17:27,515 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:17:27,516 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-22 00:17:27,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:27,936 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 32 treesize of output 27 [2021-12-22 00:17:28,086 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 26 treesize of output 14 [2021-12-22 00:17:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:28,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:30,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-22 00:17:30,709 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:30,709 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-22 00:17:30,713 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 34 treesize of output 26 [2021-12-22 00:17:30,720 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 11 treesize of output 9 [2021-12-22 00:17:41,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [752297220] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:41,199 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:41,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2021-12-22 00:17:41,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241605444] [2021-12-22 00:17:41,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:41,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-22 00:17:41,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-22 00:17:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1830, Unknown=10, NotChecked=264, Total=2256 [2021-12-22 00:17:41,201 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:17:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:43,191 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2021-12-22 00:17:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 00:17:43,192 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2021-12-22 00:17:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:43,193 INFO L225 Difference]: With dead ends: 211 [2021-12-22 00:17:43,193 INFO L226 Difference]: Without dead ends: 211 [2021-12-22 00:17:43,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=315, Invalid=2549, Unknown=10, NotChecked=318, Total=3192 [2021-12-22 00:17:43,195 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 514 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:43,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 1135 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 798 Invalid, 0 Unknown, 101 Unchecked, 1.2s Time] [2021-12-22 00:17:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-22 00:17:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 109. [2021-12-22 00:17:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 104 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-12-22 00:17:43,198 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 38 [2021-12-22 00:17:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:43,198 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-12-22 00:17:43,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:17:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-12-22 00:17:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 00:17:43,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:43,199 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-12-22 00:17:43,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:43,410 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-22 00:17:43,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:17:43,606 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2021-12-22 00:17:43,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:43,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504631711] [2021-12-22 00:17:43,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:43,607 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:43,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:43,608 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-22 00:17:43,609 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-22 00:17:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:43,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-22 00:17:43,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:43,778 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-22 00:17:43,787 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-22 00:17:44,041 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:17:44,041 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-22 00:17:44,050 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-22 00:17:44,131 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-22 00:17:44,141 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-22 00:17:44,319 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:17:44,320 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-22 00:17:44,327 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 18 treesize of output 20 [2021-12-22 00:17:44,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:44,632 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 31 treesize of output 26 [2021-12-22 00:17:44,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:44,650 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-22 00:17:44,763 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-22 00:17:44,771 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 25 treesize of output 13 [2021-12-22 00:17:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:44,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:46,513 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-22 00:17:46,556 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-22 00:17:46,575 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:46,576 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-22 00:17:46,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-12-22 00:17:46,587 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 15 treesize of output 11 [2021-12-22 00:17:46,610 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:46,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-22 00:17:46,627 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:46,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-22 00:17:46,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:17:46,634 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 27 treesize of output 19 [2021-12-22 00:17:46,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:17:46,642 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 20 treesize of output 12 [2021-12-22 00:17:47,268 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:47,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504631711] [2021-12-22 00:17:47,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504631711] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:47,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1556683692] [2021-12-22 00:17:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:47,269 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-22 00:17:47,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-22 00:17:47,269 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-22 00:17:47,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-12-22 00:17:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:47,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-22 00:17:47,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:47,505 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-22 00:17:47,512 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-22 00:17:47,723 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 00:17:47,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-22 00:17:47,744 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:17:47,744 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-22 00:17:47,801 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-22 00:17:47,816 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-22 00:17:47,880 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:17:47,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-22 00:17:47,885 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 18 treesize of output 20 [2021-12-22 00:17:48,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:48,008 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 31 treesize of output 26 [2021-12-22 00:17:48,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:48,025 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-22 00:17:48,093 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-22 00:17:48,096 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 25 treesize of output 13 [2021-12-22 00:17:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:17:48,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:48,966 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-22 00:17:49,007 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-22 00:17:49,023 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:49,024 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-22 00:17:49,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-12-22 00:17:49,033 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 15 treesize of output 11 [2021-12-22 00:17:49,059 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:49,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-22 00:17:49,069 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:49,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-22 00:17:49,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:17:49,075 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 27 treesize of output 19 [2021-12-22 00:17:49,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:17:49,081 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 20 treesize of output 12 [2021-12-22 00:17:49,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1556683692] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:49,399 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:49,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2021-12-22 00:17:49,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400364764] [2021-12-22 00:17:49,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:49,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 00:17:49,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:49,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 00:17:49,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=800, Unknown=4, NotChecked=236, Total=1122 [2021-12-22 00:17:49,400 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:51,382 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2021-12-22 00:17:51,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 00:17:51,383 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2021-12-22 00:17:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:51,384 INFO L225 Difference]: With dead ends: 237 [2021-12-22 00:17:51,384 INFO L226 Difference]: Without dead ends: 237 [2021-12-22 00:17:51,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=175, Invalid=1319, Unknown=4, NotChecked=308, Total=1806 [2021-12-22 00:17:51,385 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 621 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:51,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 1192 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 654 Invalid, 0 Unknown, 126 Unchecked, 1.1s Time] [2021-12-22 00:17:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-22 00:17:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 117. [2021-12-22 00:17:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 112 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2021-12-22 00:17:51,387 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 38 [2021-12-22 00:17:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:51,387 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2021-12-22 00:17:51,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2021-12-22 00:17:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-22 00:17:51,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:51,388 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:51,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:51,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:51,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:17:51,789 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 766820837, now seen corresponding path program 2 times [2021-12-22 00:17:51,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:51,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130582855] [2021-12-22 00:17:51,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:17:51,790 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:51,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:51,790 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:17:51,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-22 00:17:51,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 00:17:51,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:17:51,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 00:17:51,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 00:17:52,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 00:17:52,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:52,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130582855] [2021-12-22 00:17:52,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130582855] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:17:52,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:52,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-22 00:17:52,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028239248] [2021-12-22 00:17:52,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:52,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:17:52,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:17:52,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:17:52,165 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 00:17:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:52,276 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2021-12-22 00:17:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:17:52,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-22 00:17:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:52,278 INFO L225 Difference]: With dead ends: 159 [2021-12-22 00:17:52,278 INFO L226 Difference]: Without dead ends: 159 [2021-12-22 00:17:52,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:17:52,279 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 200 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:52,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 374 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:17:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-22 00:17:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 103. [2021-12-22 00:17:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-12-22 00:17:52,284 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 41 [2021-12-22 00:17:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:52,285 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-22 00:17:52,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 00:17:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2021-12-22 00:17:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-22 00:17:52,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:52,286 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2021-12-22 00:17:52,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:52,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:17:52,496 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash -168412858, now seen corresponding path program 2 times [2021-12-22 00:17:52,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:52,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214871359] [2021-12-22 00:17:52,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:17:52,497 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:52,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:52,498 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:17:52,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-22 00:17:52,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 00:17:52,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:17:52,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:17:52,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 00:17:52,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:52,695 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:52,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214871359] [2021-12-22 00:17:52,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214871359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:52,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:52,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:17:52,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978691857] [2021-12-22 00:17:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:52,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:17:52,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:17:52,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:17:52,697 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:52,733 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-12-22 00:17:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:17:52,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-22 00:17:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:52,734 INFO L225 Difference]: With dead ends: 105 [2021-12-22 00:17:52,734 INFO L226 Difference]: Without dead ends: 105 [2021-12-22 00:17:52,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-22 00:17:52,734 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:52,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 209 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:17:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-22 00:17:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2021-12-22 00:17:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3375) internal successors, (107), 96 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-12-22 00:17:52,736 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 42 [2021-12-22 00:17:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:52,737 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-12-22 00:17:52,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-12-22 00:17:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-22 00:17:52,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:52,737 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2021-12-22 00:17:52,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:52,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:17:52,944 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -168412913, now seen corresponding path program 1 times [2021-12-22 00:17:52,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:52,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749906785] [2021-12-22 00:17:52,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:52,944 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:52,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:52,945 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:17:52,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-22 00:17:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:53,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 00:17:53,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:17:53,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 00:17:53,254 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:53,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749906785] [2021-12-22 00:17:53,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749906785] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:17:53,254 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:53,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-22 00:17:53,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725219592] [2021-12-22 00:17:53,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:53,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:17:53,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:53,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:17:53,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:17:53,255 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:53,390 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2021-12-22 00:17:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:17:53,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-22 00:17:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:53,391 INFO L225 Difference]: With dead ends: 146 [2021-12-22 00:17:53,391 INFO L226 Difference]: Without dead ends: 146 [2021-12-22 00:17:53,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:17:53,391 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 212 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:53,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 404 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:17:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-22 00:17:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2021-12-22 00:17:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 92 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2021-12-22 00:17:53,398 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 42 [2021-12-22 00:17:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:53,398 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2021-12-22 00:17:53,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2021-12-22 00:17:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-22 00:17:53,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:53,399 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2021-12-22 00:17:53,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:53,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:17:53,607 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1344923923, now seen corresponding path program 1 times [2021-12-22 00:17:53,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:53,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247482022] [2021-12-22 00:17:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:53,608 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:53,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:53,609 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:17:53,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-22 00:17:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:53,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 00:17:53,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:53,743 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-22 00:17:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 00:17:53,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:53,878 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:53,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247482022] [2021-12-22 00:17:53,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247482022] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:53,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:53,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:17:53,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114793593] [2021-12-22 00:17:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:53,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:17:53,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:53,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:17:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:17:53,879 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:54,357 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2021-12-22 00:17:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:17:54,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-22 00:17:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:54,364 INFO L225 Difference]: With dead ends: 122 [2021-12-22 00:17:54,364 INFO L226 Difference]: Without dead ends: 122 [2021-12-22 00:17:54,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-22 00:17:54,365 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 273 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:54,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 264 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:17:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-22 00:17:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2021-12-22 00:17:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 95 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2021-12-22 00:17:54,387 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 45 [2021-12-22 00:17:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:54,388 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2021-12-22 00:17:54,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2021-12-22 00:17:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-22 00:17:54,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:54,389 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2021-12-22 00:17:54,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:54,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:17:54,597 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1344923924, now seen corresponding path program 1 times [2021-12-22 00:17:54,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:54,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141051570] [2021-12-22 00:17:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:54,598 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:54,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:54,599 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:17:54,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-22 00:17:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:54,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 00:17:54,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:54,751 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-22 00:17:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 00:17:55,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:17:55,036 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:55,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141051570] [2021-12-22 00:17:55,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141051570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:17:55,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:17:55,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:17:55,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108331461] [2021-12-22 00:17:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:17:55,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:17:55,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:17:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:17:55,039 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:55,560 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2021-12-22 00:17:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:17:55,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-22 00:17:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:55,561 INFO L225 Difference]: With dead ends: 134 [2021-12-22 00:17:55,562 INFO L226 Difference]: Without dead ends: 134 [2021-12-22 00:17:55,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-22 00:17:55,562 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 413 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:55,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 264 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:17:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-22 00:17:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2021-12-22 00:17:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 95 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-12-22 00:17:55,564 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 45 [2021-12-22 00:17:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:55,564 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-12-22 00:17:55,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-12-22 00:17:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-22 00:17:55,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:55,565 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:17:55,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-22 00:17:55,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:17:55,775 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1217170439, now seen corresponding path program 3 times [2021-12-22 00:17:55,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:55,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440619940] [2021-12-22 00:17:55,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 00:17:55,776 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:55,777 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:17:55,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-22 00:17:55,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-22 00:17:55,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:17:55,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 00:17:55,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 00:17:56,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:56,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:17:56,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440619940] [2021-12-22 00:17:56,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440619940] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:56,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1011240673] [2021-12-22 00:17:56,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 00:17:56,527 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-22 00:17:56,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-22 00:17:56,529 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-22 00:17:56,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2021-12-22 00:17:56,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-22 00:17:56,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:17:56,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 00:17:56,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 00:17:56,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:57,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1011240673] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:17:57,167 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:17:57,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-12-22 00:17:57,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899317170] [2021-12-22 00:17:57,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:17:57,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:17:57,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:17:57,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:17:57,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:17:57,168 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:17:57,319 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2021-12-22 00:17:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:17:57,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-12-22 00:17:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:17:57,320 INFO L225 Difference]: With dead ends: 95 [2021-12-22 00:17:57,320 INFO L226 Difference]: Without dead ends: 94 [2021-12-22 00:17:57,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-12-22 00:17:57,321 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 78 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:17:57,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 278 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:17:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-22 00:17:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-22 00:17:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:17:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-12-22 00:17:57,323 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2021-12-22 00:17:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:17:57,323 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-12-22 00:17:57,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:17:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-12-22 00:17:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-22 00:17:57,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:17:57,323 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2021-12-22 00:17:57,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-22 00:17:57,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2021-12-22 00:17:57,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-22 00:17:57,724 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:17:57,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:17:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash -399124699, now seen corresponding path program 1 times [2021-12-22 00:17:57,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:17:57,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142227486] [2021-12-22 00:17:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:17:57,725 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:17:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:17:57,726 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:17:57,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-22 00:17:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:17:57,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-22 00:17:57,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:17:58,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-22 00:17:58,161 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:17:58,162 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-22 00:17:58,224 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-22 00:17:58,310 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:17:58,310 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 19 treesize of output 22 [2021-12-22 00:17:58,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:17:58,539 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 22 treesize of output 21 [2021-12-22 00:17:58,551 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-22 00:17:58,750 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 16 treesize of output 8 [2021-12-22 00:17:58,882 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 16 treesize of output 18 [2021-12-22 00:17:59,098 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 11 [2021-12-22 00:17:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:17:59,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:17:59,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (bvmul (_ bv4294967295 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32))) is different from false [2021-12-22 00:17:59,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvmul (_ bv4294967295 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) |c_ULTIMATE.start_main_~len~0#1|) (_ bv0 32))) is different from false [2021-12-22 00:17:59,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (bvmul (_ bv4294967295 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32))) is different from false [2021-12-22 00:17:59,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvmul (_ bv4294967295 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) |c_ULTIMATE.start_main_~len~0#1|) (_ bv0 32))) is different from false [2021-12-22 00:17:59,673 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:59,673 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-12-22 00:17:59,692 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:17:59,692 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 72 treesize of output 75 [2021-12-22 00:17:59,698 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 29 treesize of output 25 [2021-12-22 00:18:00,496 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (_ BitVec 32)) (v_ArrVal_1106 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1109) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-22 00:18:00,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (_ BitVec 32)) (v_ArrVal_1106 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1109) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-22 00:18:00,517 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:18:00,517 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-22 00:18:00,520 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 43 treesize of output 39 [2021-12-22 00:18:00,523 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 52 treesize of output 48 [2021-12-22 00:18:00,540 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 24 treesize of output 22 [2021-12-22 00:18:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-22 00:18:01,209 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:18:01,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142227486] [2021-12-22 00:18:01,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142227486] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:18:01,209 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:18:01,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2021-12-22 00:18:01,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020716256] [2021-12-22 00:18:01,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:18:01,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-22 00:18:01,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:18:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-22 00:18:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1463, Unknown=6, NotChecked=486, Total=2070 [2021-12-22 00:18:01,210 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 00:18:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:18:04,247 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-12-22 00:18:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-22 00:18:04,248 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2021-12-22 00:18:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:18:04,248 INFO L225 Difference]: With dead ends: 94 [2021-12-22 00:18:04,248 INFO L226 Difference]: Without dead ends: 94 [2021-12-22 00:18:04,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=272, Invalid=2826, Unknown=6, NotChecked=678, Total=3782 [2021-12-22 00:18:04,249 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 201 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-22 00:18:04,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 1267 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 793 Invalid, 0 Unknown, 657 Unchecked, 1.5s Time] [2021-12-22 00:18:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-22 00:18:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-22 00:18:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:18:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-12-22 00:18:04,251 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 49 [2021-12-22 00:18:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:18:04,251 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-12-22 00:18:04,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 00:18:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-12-22 00:18:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-22 00:18:04,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:18:04,252 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2021-12-22 00:18:04,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-22 00:18:04,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:18:04,461 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:18:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:18:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 780049028, now seen corresponding path program 1 times [2021-12-22 00:18:04,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:18:04,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514091168] [2021-12-22 00:18:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:18:04,461 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:18:04,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:18:04,462 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:18:04,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-22 00:18:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:18:04,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 00:18:04,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:18:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-22 00:18:04,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:18:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-22 00:18:04,894 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:18:04,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514091168] [2021-12-22 00:18:04,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514091168] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:18:04,894 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:18:04,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-22 00:18:04,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532706410] [2021-12-22 00:18:04,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:18:04,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:18:04,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:18:04,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:18:04,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:18:04,896 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:18:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:18:05,028 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2021-12-22 00:18:05,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:18:05,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2021-12-22 00:18:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:18:05,029 INFO L225 Difference]: With dead ends: 134 [2021-12-22 00:18:05,029 INFO L226 Difference]: Without dead ends: 134 [2021-12-22 00:18:05,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-12-22 00:18:05,030 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 115 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:18:05,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 514 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:18:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-22 00:18:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2021-12-22 00:18:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 93 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-22 00:18:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2021-12-22 00:18:05,032 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 55 [2021-12-22 00:18:05,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:18:05,032 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2021-12-22 00:18:05,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-22 00:18:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2021-12-22 00:18:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-22 00:18:05,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:18:05,033 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2021-12-22 00:18:05,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-22 00:18:05,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:18:05,233 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-22 00:18:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:18:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash 780048973, now seen corresponding path program 1 times [2021-12-22 00:18:05,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:18:05,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32180556] [2021-12-22 00:18:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:18:05,234 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:18:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:18:05,235 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:18:05,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-22 00:18:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:18:05,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 78 conjunts are in the unsatisfiable core [2021-12-22 00:18:05,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:18:05,554 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-22 00:18:05,764 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:18:05,765 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-22 00:18:05,850 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-22 00:18:05,857 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-22 00:18:06,036 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:18:06,036 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-22 00:18:06,041 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 18 treesize of output 20