./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/memsafety-ext/skiplist_2lvl.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:32:01,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:32:01,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:32:01,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:32:01,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:32:01,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:32:01,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:32:01,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:32:01,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:32:01,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:32:01,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:32:01,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:32:01,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:32:01,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:32:01,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:32:01,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:32:01,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:32:01,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:32:01,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:32:01,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:32:01,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:32:01,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:32:01,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:32:01,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:32:01,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:32:01,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:32:01,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:32:01,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:32:01,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:32:01,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:32:01,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:32:01,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:32:01,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:32:01,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:32:01,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:32:01,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:32:01,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:32:01,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:32:01,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:32:01,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:32:01,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:32:01,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 16:32:01,633 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:32:01,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:32:01,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:32:01,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:32:01,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:32:01,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:32:01,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:32:01,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:32:01,636 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:32:01,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:32:01,637 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:32:01,638 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:32:01,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:32:01,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:32:01,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:32:01,638 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:32:01,638 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:32:01,639 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:32:01,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:32:01,639 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:32:01,639 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:32:01,639 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:32:01,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:32:01,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:32:01,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:32:01,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:32:01,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:32:01,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:32:01,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:32:01,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:32:01,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:32:01,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2021-12-22 16:32:01,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:32:01,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:32:01,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:32:01,890 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:32:01,890 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:32:01,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-22 16:32:01,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad53b10a/85b3a28a5e0143e7abd4f0941c6e8051/FLAG6e01554ec [2021-12-22 16:32:02,327 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:32:02,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-22 16:32:02,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad53b10a/85b3a28a5e0143e7abd4f0941c6e8051/FLAG6e01554ec [2021-12-22 16:32:02,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad53b10a/85b3a28a5e0143e7abd4f0941c6e8051 [2021-12-22 16:32:02,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:32:02,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:32:02,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:32:02,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:32:02,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:32:02,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:32:02" (1/1) ... [2021-12-22 16:32:02,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9853aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:02, skipping insertion in model container [2021-12-22 16:32:02,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:32:02" (1/1) ... [2021-12-22 16:32:02,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:32:02,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:32:03,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:32:03,031 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:32:03,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:32:03,104 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:32:03,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03 WrapperNode [2021-12-22 16:32:03,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:32:03,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:32:03,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:32:03,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:32:03,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,169 INFO L137 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2021-12-22 16:32:03,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:32:03,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:32:03,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:32:03,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:32:03,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:32:03,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:32:03,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:32:03,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:32:03,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (1/1) ... [2021-12-22 16:32:03,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:32:03,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:32:03,237 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 16:32:03,239 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 16:32:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:32:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:32:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:32:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:32:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:32:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:32:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:32:03,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:32:03,375 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:32:03,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:32:03,746 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:32:03,754 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:32:03,755 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-22 16:32:03,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:32:03 BoogieIcfgContainer [2021-12-22 16:32:03,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:32:03,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:32:03,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:32:03,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:32:03,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:32:02" (1/3) ... [2021-12-22 16:32:03,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6fe97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:32:03, skipping insertion in model container [2021-12-22 16:32:03,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:03" (2/3) ... [2021-12-22 16:32:03,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6fe97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:32:03, skipping insertion in model container [2021-12-22 16:32:03,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:32:03" (3/3) ... [2021-12-22 16:32:03,767 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2021-12-22 16:32:03,776 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:32:03,776 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-22 16:32:03,821 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:32:03,835 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 16:32:03,835 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-22 16:32:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:32:03,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:03,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:32:03,865 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 16:32:03,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:03,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555208893] [2021-12-22 16:32:03,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:03,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:04,071 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 16:32:04,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555208893] [2021-12-22 16:32:04,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555208893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:04,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:04,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:32:04,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583986495] [2021-12-22 16:32:04,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:04,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:04,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:04,110 INFO L87 Difference]: Start difference. First operand has 133 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:04,280 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2021-12-22 16:32:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:04,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:32:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:04,295 INFO L225 Difference]: With dead ends: 156 [2021-12-22 16:32:04,296 INFO L226 Difference]: Without dead ends: 154 [2021-12-22 16:32:04,298 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 16:32:04,301 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 122 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:04,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-22 16:32:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 124. [2021-12-22 16:32:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9696969696969697) internal successors, (130), 123 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2021-12-22 16:32:04,353 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2021-12-22 16:32:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:04,353 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2021-12-22 16:32:04,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2021-12-22 16:32:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:32:04,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:04,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:32:04,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:32:04,356 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 16:32:04,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:04,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888176607] [2021-12-22 16:32:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:04,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:04,430 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 16:32:04,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:04,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888176607] [2021-12-22 16:32:04,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888176607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:04,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:04,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:32:04,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239868442] [2021-12-22 16:32:04,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:04,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:04,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:04,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:04,434 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:04,515 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-12-22 16:32:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:04,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:32:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:04,519 INFO L225 Difference]: With dead ends: 117 [2021-12-22 16:32:04,520 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 16:32:04,520 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 16:32:04,524 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:04,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 69 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 16:32:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-12-22 16:32:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 116 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2021-12-22 16:32:04,542 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 3 [2021-12-22 16:32:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:04,543 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2021-12-22 16:32:04,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2021-12-22 16:32:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 16:32:04,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:04,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:04,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:32:04,547 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606480, now seen corresponding path program 1 times [2021-12-22 16:32:04,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:04,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250166644] [2021-12-22 16:32:04,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:04,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:04,634 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 16:32:04,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:04,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250166644] [2021-12-22 16:32:04,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250166644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:04,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:04,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:04,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587897885] [2021-12-22 16:32:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:04,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:04,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:04,641 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:04,797 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-12-22 16:32:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:04,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 16:32:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:04,799 INFO L225 Difference]: With dead ends: 116 [2021-12-22 16:32:04,799 INFO L226 Difference]: Without dead ends: 116 [2021-12-22 16:32:04,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:04,801 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:04,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 294 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-22 16:32:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-22 16:32:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 115 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2021-12-22 16:32:04,806 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 10 [2021-12-22 16:32:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:04,806 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2021-12-22 16:32:04,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2021-12-22 16:32:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 16:32:04,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:04,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:04,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:32:04,816 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606481, now seen corresponding path program 1 times [2021-12-22 16:32:04,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:04,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354712212] [2021-12-22 16:32:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:04,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:04,971 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 16:32:04,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:04,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354712212] [2021-12-22 16:32:04,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354712212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:04,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:04,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:04,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760710045] [2021-12-22 16:32:04,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:04,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:04,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:04,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:04,973 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:05,145 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-12-22 16:32:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:05,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 16:32:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:05,146 INFO L225 Difference]: With dead ends: 115 [2021-12-22 16:32:05,146 INFO L226 Difference]: Without dead ends: 115 [2021-12-22 16:32:05,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:32:05,147 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 10 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:05,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 283 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-22 16:32:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-12-22 16:32:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8333333333333333) internal successors, (121), 114 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2021-12-22 16:32:05,151 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 10 [2021-12-22 16:32:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:05,152 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2021-12-22 16:32:05,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2021-12-22 16:32:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:32:05,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:05,152 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:05,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:32:05,153 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-12-22 16:32:05,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:05,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021732765] [2021-12-22 16:32:05,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:05,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:05,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:05,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021732765] [2021-12-22 16:32:05,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021732765] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:05,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:05,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:05,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635787515] [2021-12-22 16:32:05,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:05,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:05,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:05,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:05,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:05,212 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:05,305 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-12-22 16:32:05,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:32:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 16:32:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:05,306 INFO L225 Difference]: With dead ends: 114 [2021-12-22 16:32:05,306 INFO L226 Difference]: Without dead ends: 114 [2021-12-22 16:32:05,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:05,308 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:05,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 374 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-22 16:32:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-12-22 16:32:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 113 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2021-12-22 16:32:05,320 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 11 [2021-12-22 16:32:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:05,320 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2021-12-22 16:32:05,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2021-12-22 16:32:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:32:05,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:05,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:05,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:32:05,324 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-12-22 16:32:05,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:05,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574483630] [2021-12-22 16:32:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:05,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:05,511 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 16:32:05,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:05,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574483630] [2021-12-22 16:32:05,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574483630] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:05,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:05,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:32:05,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975571589] [2021-12-22 16:32:05,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:05,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:32:05,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:05,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:32:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:32:05,523 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:05,750 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2021-12-22 16:32:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:32:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 16:32:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:05,751 INFO L225 Difference]: With dead ends: 113 [2021-12-22 16:32:05,751 INFO L226 Difference]: Without dead ends: 113 [2021-12-22 16:32:05,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-22 16:32:05,752 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:05,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 410 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-22 16:32:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-12-22 16:32:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.803030303030303) internal successors, (119), 112 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2021-12-22 16:32:05,755 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 11 [2021-12-22 16:32:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:05,755 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2021-12-22 16:32:05,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2021-12-22 16:32:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:32:05,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:05,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:05,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:32:05,756 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:05,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash -266592339, now seen corresponding path program 1 times [2021-12-22 16:32:05,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:05,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181488869] [2021-12-22 16:32:05,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:05,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:05,890 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 16:32:05,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:05,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181488869] [2021-12-22 16:32:05,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181488869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:05,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:05,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 16:32:05,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018226932] [2021-12-22 16:32:05,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:05,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 16:32:05,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:05,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 16:32:05,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-22 16:32:05,892 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:06,120 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2021-12-22 16:32:06,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:32:06,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 16:32:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:06,121 INFO L225 Difference]: With dead ends: 112 [2021-12-22 16:32:06,121 INFO L226 Difference]: Without dead ends: 112 [2021-12-22 16:32:06,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-22 16:32:06,122 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:06,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 578 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-22 16:32:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-12-22 16:32:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 111 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2021-12-22 16:32:06,125 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 15 [2021-12-22 16:32:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:06,125 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2021-12-22 16:32:06,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2021-12-22 16:32:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:32:06,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:06,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:06,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:32:06,126 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash -266592338, now seen corresponding path program 1 times [2021-12-22 16:32:06,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:06,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143836688] [2021-12-22 16:32:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:06,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:06,285 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 16:32:06,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:06,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143836688] [2021-12-22 16:32:06,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143836688] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:06,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:06,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 16:32:06,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121842270] [2021-12-22 16:32:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:06,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 16:32:06,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 16:32:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-22 16:32:06,288 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:06,470 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-22 16:32:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:32:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 16:32:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:06,471 INFO L225 Difference]: With dead ends: 111 [2021-12-22 16:32:06,471 INFO L226 Difference]: Without dead ends: 111 [2021-12-22 16:32:06,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-22 16:32:06,472 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 20 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:06,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-22 16:32:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-22 16:32:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2021-12-22 16:32:06,475 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 15 [2021-12-22 16:32:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:06,475 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2021-12-22 16:32:06,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2021-12-22 16:32:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 16:32:06,476 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:06,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:06,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:32:06,476 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash 325572089, now seen corresponding path program 1 times [2021-12-22 16:32:06,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:06,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805466528] [2021-12-22 16:32:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:06,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:06,511 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 16:32:06,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:06,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805466528] [2021-12-22 16:32:06,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805466528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:06,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:06,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:06,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688610498] [2021-12-22 16:32:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:06,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:06,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:06,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:06,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:06,513 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:06,591 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-12-22 16:32:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:32:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-22 16:32:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:06,592 INFO L225 Difference]: With dead ends: 110 [2021-12-22 16:32:06,592 INFO L226 Difference]: Without dead ends: 110 [2021-12-22 16:32:06,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:06,593 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 5 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:06,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 363 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-22 16:32:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-22 16:32:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.7575757575757576) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2021-12-22 16:32:06,595 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 16 [2021-12-22 16:32:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:06,596 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2021-12-22 16:32:06,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2021-12-22 16:32:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 16:32:06,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:06,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:06,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:32:06,597 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:06,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash 325572090, now seen corresponding path program 1 times [2021-12-22 16:32:06,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:06,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771156351] [2021-12-22 16:32:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:06,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:06,787 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 16:32:06,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:06,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771156351] [2021-12-22 16:32:06,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771156351] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:06,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:06,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 16:32:06,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874172226] [2021-12-22 16:32:06,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:06,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 16:32:06,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:06,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 16:32:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-22 16:32:06,788 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:06,967 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2021-12-22 16:32:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:32:06,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-22 16:32:06,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:06,968 INFO L225 Difference]: With dead ends: 109 [2021-12-22 16:32:06,968 INFO L226 Difference]: Without dead ends: 109 [2021-12-22 16:32:06,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-22 16:32:06,969 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:06,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 473 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-22 16:32:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-22 16:32:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2021-12-22 16:32:06,971 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 16 [2021-12-22 16:32:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:06,972 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2021-12-22 16:32:06,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2021-12-22 16:32:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 16:32:06,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:06,972 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:06,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 16:32:06,972 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:06,973 INFO L85 PathProgramCache]: Analyzing trace with hash 379588598, now seen corresponding path program 1 times [2021-12-22 16:32:06,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:06,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158982235] [2021-12-22 16:32:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:06,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:07,029 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 16:32:07,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:07,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158982235] [2021-12-22 16:32:07,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158982235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:07,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:07,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:07,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904929099] [2021-12-22 16:32:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:07,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:07,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:07,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:07,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:07,031 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:07,175 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2021-12-22 16:32:07,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:07,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 16:32:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:07,177 INFO L225 Difference]: With dead ends: 170 [2021-12-22 16:32:07,177 INFO L226 Difference]: Without dead ends: 170 [2021-12-22 16:32:07,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:07,177 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 362 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:07,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 155 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-22 16:32:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 107. [2021-12-22 16:32:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 106 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-12-22 16:32:07,180 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 21 [2021-12-22 16:32:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:07,180 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-12-22 16:32:07,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-12-22 16:32:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 16:32:07,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:07,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:07,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 16:32:07,181 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:07,182 INFO L85 PathProgramCache]: Analyzing trace with hash 379588599, now seen corresponding path program 1 times [2021-12-22 16:32:07,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:07,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033702499] [2021-12-22 16:32:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:07,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:07,255 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 16:32:07,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:07,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033702499] [2021-12-22 16:32:07,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033702499] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:07,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:07,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:07,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228807066] [2021-12-22 16:32:07,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:07,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:07,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:07,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:07,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:07,257 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:07,401 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2021-12-22 16:32:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:07,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 16:32:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:07,403 INFO L225 Difference]: With dead ends: 141 [2021-12-22 16:32:07,403 INFO L226 Difference]: Without dead ends: 141 [2021-12-22 16:32:07,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:32:07,403 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 382 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:07,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 117 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-22 16:32:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2021-12-22 16:32:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2021-12-22 16:32:07,406 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 21 [2021-12-22 16:32:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:07,407 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2021-12-22 16:32:07,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2021-12-22 16:32:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 16:32:07,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:07,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:07,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 16:32:07,408 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1117654205, now seen corresponding path program 1 times [2021-12-22 16:32:07,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:07,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166481967] [2021-12-22 16:32:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:07,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:07,466 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 16:32:07,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:07,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166481967] [2021-12-22 16:32:07,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166481967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:07,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:07,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:07,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122144355] [2021-12-22 16:32:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:07,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:07,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:07,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:07,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:07,469 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:07,623 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2021-12-22 16:32:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:07,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-22 16:32:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:07,624 INFO L225 Difference]: With dead ends: 126 [2021-12-22 16:32:07,625 INFO L226 Difference]: Without dead ends: 126 [2021-12-22 16:32:07,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:07,625 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 297 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:07,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 130 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-22 16:32:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2021-12-22 16:32:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.626865671641791) internal successors, (109), 101 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-12-22 16:32:07,629 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 22 [2021-12-22 16:32:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:07,629 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-12-22 16:32:07,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-12-22 16:32:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 16:32:07,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:07,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:07,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 16:32:07,630 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1117654204, now seen corresponding path program 1 times [2021-12-22 16:32:07,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:07,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312868879] [2021-12-22 16:32:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:07,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:07,723 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 16:32:07,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:07,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312868879] [2021-12-22 16:32:07,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312868879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:07,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:07,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:07,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686578970] [2021-12-22 16:32:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:07,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:07,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:07,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:07,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:07,725 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:07,841 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2021-12-22 16:32:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:07,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-22 16:32:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:07,842 INFO L225 Difference]: With dead ends: 97 [2021-12-22 16:32:07,842 INFO L226 Difference]: Without dead ends: 97 [2021-12-22 16:32:07,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:32:07,843 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 372 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:07,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 90 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-22 16:32:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-12-22 16:32:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.537313432835821) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2021-12-22 16:32:07,845 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 22 [2021-12-22 16:32:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:07,845 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2021-12-22 16:32:07,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2021-12-22 16:32:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 16:32:07,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:07,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:07,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 16:32:07,846 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash -287576677, now seen corresponding path program 1 times [2021-12-22 16:32:07,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:07,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553218216] [2021-12-22 16:32:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:07,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:08,095 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 16:32:08,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:08,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553218216] [2021-12-22 16:32:08,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553218216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:08,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:08,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-22 16:32:08,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675110786] [2021-12-22 16:32:08,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:08,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 16:32:08,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 16:32:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-12-22 16:32:08,097 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:08,771 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2021-12-22 16:32:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 16:32:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 16:32:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:08,772 INFO L225 Difference]: With dead ends: 165 [2021-12-22 16:32:08,772 INFO L226 Difference]: Without dead ends: 165 [2021-12-22 16:32:08,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2021-12-22 16:32:08,773 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 413 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:08,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 774 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:32:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-22 16:32:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2021-12-22 16:32:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-12-22 16:32:08,776 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 23 [2021-12-22 16:32:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:08,776 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-12-22 16:32:08,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-12-22 16:32:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 16:32:08,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:08,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:08,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 16:32:08,777 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash -287576676, now seen corresponding path program 1 times [2021-12-22 16:32:08,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:08,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883778051] [2021-12-22 16:32:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:08,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:09,141 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 16:32:09,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:09,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883778051] [2021-12-22 16:32:09,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883778051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:09,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:09,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-22 16:32:09,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801082340] [2021-12-22 16:32:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:09,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-22 16:32:09,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-22 16:32:09,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-12-22 16:32:09,143 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:09,975 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2021-12-22 16:32:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 16:32:09,976 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 16:32:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:09,977 INFO L225 Difference]: With dead ends: 211 [2021-12-22 16:32:09,977 INFO L226 Difference]: Without dead ends: 211 [2021-12-22 16:32:09,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2021-12-22 16:32:09,978 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 628 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:09,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 811 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:32:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-22 16:32:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2021-12-22 16:32:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2021-12-22 16:32:09,981 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 23 [2021-12-22 16:32:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:09,981 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2021-12-22 16:32:09,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2021-12-22 16:32:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 16:32:09,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:09,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:09,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 16:32:09,982 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1449815588, now seen corresponding path program 1 times [2021-12-22 16:32:09,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:09,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465528987] [2021-12-22 16:32:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:09,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:10,025 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 16:32:10,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:10,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465528987] [2021-12-22 16:32:10,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465528987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:10,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:10,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:10,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538971565] [2021-12-22 16:32:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:10,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:10,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:10,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:10,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:10,027 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:10,081 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2021-12-22 16:32:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-22 16:32:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:10,088 INFO L225 Difference]: With dead ends: 121 [2021-12-22 16:32:10,088 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 16:32:10,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:10,089 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 258 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:10,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 146 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:32:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 16:32:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-22 16:32:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2021-12-22 16:32:10,093 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 25 [2021-12-22 16:32:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:10,093 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2021-12-22 16:32:10,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2021-12-22 16:32:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:32:10,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:10,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:10,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 16:32:10,094 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1702259996, now seen corresponding path program 1 times [2021-12-22 16:32:10,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:10,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320984481] [2021-12-22 16:32:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:10,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:10,319 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 16:32:10,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320984481] [2021-12-22 16:32:10,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320984481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:10,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:10,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-22 16:32:10,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034101665] [2021-12-22 16:32:10,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:10,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-22 16:32:10,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:10,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-22 16:32:10,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-22 16:32:10,322 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:10,820 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2021-12-22 16:32:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:32:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 16:32:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:10,821 INFO L225 Difference]: With dead ends: 166 [2021-12-22 16:32:10,821 INFO L226 Difference]: Without dead ends: 166 [2021-12-22 16:32:10,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2021-12-22 16:32:10,822 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 320 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:10,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 705 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-22 16:32:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-12-22 16:32:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 127 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2021-12-22 16:32:10,826 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2021-12-22 16:32:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:10,826 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2021-12-22 16:32:10,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2021-12-22 16:32:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:32:10,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:10,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:10,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 16:32:10,828 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:10,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1702259995, now seen corresponding path program 1 times [2021-12-22 16:32:10,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:10,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146448239] [2021-12-22 16:32:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:10,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:11,172 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 16:32:11,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:11,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146448239] [2021-12-22 16:32:11,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146448239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:11,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:11,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-22 16:32:11,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775361477] [2021-12-22 16:32:11,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:11,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 16:32:11,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 16:32:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-12-22 16:32:11,173 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:11,835 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2021-12-22 16:32:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:32:11,835 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 16:32:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:11,836 INFO L225 Difference]: With dead ends: 166 [2021-12-22 16:32:11,836 INFO L226 Difference]: Without dead ends: 166 [2021-12-22 16:32:11,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2021-12-22 16:32:11,837 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 272 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:11,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 629 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-22 16:32:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-12-22 16:32:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 127 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2021-12-22 16:32:11,841 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 27 [2021-12-22 16:32:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:11,841 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2021-12-22 16:32:11,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2021-12-22 16:32:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 16:32:11,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:11,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:11,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 16:32:11,843 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1264836991, now seen corresponding path program 1 times [2021-12-22 16:32:11,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:11,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079625268] [2021-12-22 16:32:11,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:11,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:12,064 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 16:32:12,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:12,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079625268] [2021-12-22 16:32:12,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079625268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:12,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:12,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-22 16:32:12,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912913349] [2021-12-22 16:32:12,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:12,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 16:32:12,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:12,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 16:32:12,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-12-22 16:32:12,065 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:12,481 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2021-12-22 16:32:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 16:32:12,481 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-22 16:32:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:12,482 INFO L225 Difference]: With dead ends: 159 [2021-12-22 16:32:12,482 INFO L226 Difference]: Without dead ends: 159 [2021-12-22 16:32:12,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2021-12-22 16:32:12,483 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 195 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:12,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 774 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-22 16:32:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 128. [2021-12-22 16:32:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 127 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2021-12-22 16:32:12,487 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 28 [2021-12-22 16:32:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:12,487 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2021-12-22 16:32:12,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2021-12-22 16:32:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:32:12,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:12,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:12,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 16:32:12,489 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:12,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2059816375, now seen corresponding path program 1 times [2021-12-22 16:32:12,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:12,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911504465] [2021-12-22 16:32:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:12,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:12,527 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 16:32:12,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:12,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911504465] [2021-12-22 16:32:12,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911504465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:12,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:12,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:32:12,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122270628] [2021-12-22 16:32:12,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:12,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:32:12,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:12,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:32:12,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:32:12,530 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:12,611 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2021-12-22 16:32:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:32:12,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 16:32:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:12,612 INFO L225 Difference]: With dead ends: 146 [2021-12-22 16:32:12,612 INFO L226 Difference]: Without dead ends: 146 [2021-12-22 16:32:12,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:12,613 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:12,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 131 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-22 16:32:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2021-12-22 16:32:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 126 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2021-12-22 16:32:12,616 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 29 [2021-12-22 16:32:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:12,616 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2021-12-22 16:32:12,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2021-12-22 16:32:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:32:12,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:12,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:12,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-22 16:32:12,618 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:12,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2059816374, now seen corresponding path program 1 times [2021-12-22 16:32:12,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:12,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580589979] [2021-12-22 16:32:12,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:12,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:12,909 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 16:32:12,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:12,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580589979] [2021-12-22 16:32:12,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580589979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:12,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:12,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-22 16:32:12,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753768986] [2021-12-22 16:32:12,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:12,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 16:32:12,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 16:32:12,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-22 16:32:12,910 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:13,566 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2021-12-22 16:32:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:32:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 16:32:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:13,568 INFO L225 Difference]: With dead ends: 202 [2021-12-22 16:32:13,568 INFO L226 Difference]: Without dead ends: 202 [2021-12-22 16:32:13,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2021-12-22 16:32:13,569 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 473 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:13,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 1196 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:32:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-22 16:32:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 132. [2021-12-22 16:32:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.4181818181818182) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2021-12-22 16:32:13,576 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 29 [2021-12-22 16:32:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:13,577 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2021-12-22 16:32:13,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2021-12-22 16:32:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:32:13,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:13,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:13,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-22 16:32:13,580 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1348537848, now seen corresponding path program 1 times [2021-12-22 16:32:13,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:13,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146377565] [2021-12-22 16:32:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:13,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:13,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 16:32:13,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:13,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146377565] [2021-12-22 16:32:13,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146377565] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:13,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:13,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-22 16:32:13,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274179729] [2021-12-22 16:32:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:13,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-22 16:32:13,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:13,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-22 16:32:13,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-12-22 16:32:13,850 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:14,333 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2021-12-22 16:32:14,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 16:32:14,333 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-22 16:32:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:14,334 INFO L225 Difference]: With dead ends: 173 [2021-12-22 16:32:14,334 INFO L226 Difference]: Without dead ends: 173 [2021-12-22 16:32:14,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2021-12-22 16:32:14,335 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 246 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:14,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 747 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-22 16:32:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2021-12-22 16:32:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.407079646017699) internal successors, (159), 134 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2021-12-22 16:32:14,338 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 30 [2021-12-22 16:32:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:14,338 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2021-12-22 16:32:14,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2021-12-22 16:32:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:32:14,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:14,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:14,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-22 16:32:14,339 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash 570254421, now seen corresponding path program 1 times [2021-12-22 16:32:14,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:14,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930960278] [2021-12-22 16:32:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:14,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:15,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930960278] [2021-12-22 16:32:15,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930960278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:15,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:15,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-12-22 16:32:15,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924222471] [2021-12-22 16:32:15,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:15,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-22 16:32:15,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:15,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-22 16:32:15,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2021-12-22 16:32:15,027 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:16,201 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2021-12-22 16:32:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-22 16:32:16,202 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-22 16:32:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:16,202 INFO L225 Difference]: With dead ends: 140 [2021-12-22 16:32:16,203 INFO L226 Difference]: Without dead ends: 140 [2021-12-22 16:32:16,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2021-12-22 16:32:16,204 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 232 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:16,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 914 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:32:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-22 16:32:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2021-12-22 16:32:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-22 16:32:16,208 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 30 [2021-12-22 16:32:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:16,208 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-22 16:32:16,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-22 16:32:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-22 16:32:16,209 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:16,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:16,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 16:32:16,209 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:16,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1144999879, now seen corresponding path program 1 times [2021-12-22 16:32:16,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:16,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956428860] [2021-12-22 16:32:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:16,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:16,475 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 16:32:16,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:16,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956428860] [2021-12-22 16:32:16,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956428860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:16,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:16,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-22 16:32:16,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008620951] [2021-12-22 16:32:16,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:16,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-22 16:32:16,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:16,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-22 16:32:16,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-12-22 16:32:16,477 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:16,932 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-22 16:32:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 16:32:16,933 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-22 16:32:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:16,933 INFO L225 Difference]: With dead ends: 150 [2021-12-22 16:32:16,933 INFO L226 Difference]: Without dead ends: 150 [2021-12-22 16:32:16,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2021-12-22 16:32:16,935 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 206 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:16,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 587 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-22 16:32:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2021-12-22 16:32:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-12-22 16:32:16,938 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 31 [2021-12-22 16:32:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:16,938 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-12-22 16:32:16,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-12-22 16:32:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 16:32:16,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:16,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:16,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-22 16:32:16,939 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1135258090, now seen corresponding path program 1 times [2021-12-22 16:32:16,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:16,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259222054] [2021-12-22 16:32:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:16,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:16,983 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 16:32:16,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:16,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259222054] [2021-12-22 16:32:16,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259222054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:16,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:16,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:16,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704652285] [2021-12-22 16:32:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:16,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:16,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:16,985 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:17,068 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2021-12-22 16:32:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 16:32:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-22 16:32:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:17,069 INFO L225 Difference]: With dead ends: 134 [2021-12-22 16:32:17,069 INFO L226 Difference]: Without dead ends: 134 [2021-12-22 16:32:17,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:17,069 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:17,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 315 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-22 16:32:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-12-22 16:32:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-22 16:32:17,072 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 32 [2021-12-22 16:32:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:17,073 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-22 16:32:17,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-22 16:32:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 16:32:17,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:17,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:17,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-22 16:32:17,074 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash 833262606, now seen corresponding path program 1 times [2021-12-22 16:32:17,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:17,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003260132] [2021-12-22 16:32:17,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:17,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:17,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:17,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003260132] [2021-12-22 16:32:17,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003260132] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:32:17,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720042486] [2021-12-22 16:32:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:17,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:32:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:32:17,379 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 16:32:17,383 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 16:32:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:17,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-22 16:32:17,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:17,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-22 16:32:17,731 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 16:32:17,766 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:32:17,766 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 16:32:17,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:17,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-22 16:32:17,922 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:17,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-22 16:32:17,952 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:17,952 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 16:32:18,049 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:18,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-22 16:32:18,075 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:18,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-22 16:32:18,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-22 16:32:18,365 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 16:32:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:18,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:32:18,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-22 16:32:18,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1050) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,595 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1050) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,603 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,615 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1048) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1048) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1049)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1) v_ArrVal_1051))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-22 16:32:18,768 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:32:18,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 58 [2021-12-22 16:32:18,782 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-22 16:32:18,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 2 case distinctions, treesize of input 75 treesize of output 79 [2021-12-22 16:32:18,796 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 16:32:18,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 419 treesize of output 325 [2021-12-22 16:32:18,823 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 16:32:18,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 156 [2021-12-22 16:32:18,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 148 [2021-12-22 16:32:18,838 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 16:32:18,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-22 16:32:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:18,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720042486] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:32:18,885 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:32:18,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 20] total 44 [2021-12-22 16:32:18,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528782811] [2021-12-22 16:32:18,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:32:18,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-22 16:32:18,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:18,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-22 16:32:18,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1131, Unknown=9, NotChecked=684, Total=1980 [2021-12-22 16:32:18,887 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:19,949 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2021-12-22 16:32:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 16:32:19,950 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-22 16:32:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:19,951 INFO L225 Difference]: With dead ends: 148 [2021-12-22 16:32:19,951 INFO L226 Difference]: Without dead ends: 148 [2021-12-22 16:32:19,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=310, Invalid=1973, Unknown=9, NotChecked=900, Total=3192 [2021-12-22 16:32:19,952 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 233 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 841 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:19,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1211 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 821 Invalid, 0 Unknown, 841 Unchecked, 0.4s Time] [2021-12-22 16:32:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-22 16:32:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2021-12-22 16:32:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-12-22 16:32:19,955 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 33 [2021-12-22 16:32:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:19,955 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-12-22 16:32:19,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-12-22 16:32:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 16:32:19,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:19,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:19,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-22 16:32:20,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-22 16:32:20,169 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2032785906, now seen corresponding path program 1 times [2021-12-22 16:32:20,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:20,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428211293] [2021-12-22 16:32:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:20,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:20,266 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 16:32:20,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:20,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428211293] [2021-12-22 16:32:20,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428211293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:20,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:20,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:20,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526729587] [2021-12-22 16:32:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:20,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:20,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:20,267 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:20,436 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2021-12-22 16:32:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:20,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-22 16:32:20,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:20,437 INFO L225 Difference]: With dead ends: 231 [2021-12-22 16:32:20,437 INFO L226 Difference]: Without dead ends: 231 [2021-12-22 16:32:20,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:20,438 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 212 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:20,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 237 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-22 16:32:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 145. [2021-12-22 16:32:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 144 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 171 transitions. [2021-12-22 16:32:20,441 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 171 transitions. Word has length 35 [2021-12-22 16:32:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:20,441 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 171 transitions. [2021-12-22 16:32:20,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 171 transitions. [2021-12-22 16:32:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 16:32:20,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:20,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:20,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-22 16:32:20,442 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:20,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1408146296, now seen corresponding path program 1 times [2021-12-22 16:32:20,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:20,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926996510] [2021-12-22 16:32:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:20,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:20,469 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 16:32:20,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:20,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926996510] [2021-12-22 16:32:20,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926996510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:20,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:20,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:32:20,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991173791] [2021-12-22 16:32:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:20,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:20,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:20,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:20,472 INFO L87 Difference]: Start difference. First operand 145 states and 171 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:20,525 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2021-12-22 16:32:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:20,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-22 16:32:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:20,526 INFO L225 Difference]: With dead ends: 161 [2021-12-22 16:32:20,527 INFO L226 Difference]: Without dead ends: 161 [2021-12-22 16:32:20,527 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 16:32:20,527 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:20,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 136 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-22 16:32:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2021-12-22 16:32:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 142 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2021-12-22 16:32:20,531 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 36 [2021-12-22 16:32:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:20,531 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2021-12-22 16:32:20,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2021-12-22 16:32:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 16:32:20,531 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:20,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:20,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-22 16:32:20,532 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1408146295, now seen corresponding path program 1 times [2021-12-22 16:32:20,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:20,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116161974] [2021-12-22 16:32:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:20,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:20,570 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 16:32:20,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:20,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116161974] [2021-12-22 16:32:20,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116161974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:20,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:20,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:32:20,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733371031] [2021-12-22 16:32:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:20,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:20,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:20,572 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:20,627 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2021-12-22 16:32:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:20,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-22 16:32:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:20,628 INFO L225 Difference]: With dead ends: 164 [2021-12-22 16:32:20,628 INFO L226 Difference]: Without dead ends: 164 [2021-12-22 16:32:20,629 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 16:32:20,629 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:20,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 138 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:32:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-22 16:32:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2021-12-22 16:32:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 140 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2021-12-22 16:32:20,633 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 36 [2021-12-22 16:32:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:20,633 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2021-12-22 16:32:20,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2021-12-22 16:32:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 16:32:20,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:20,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:20,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-22 16:32:20,634 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1408093625, now seen corresponding path program 1 times [2021-12-22 16:32:20,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:20,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882846625] [2021-12-22 16:32:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:20,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:21,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:21,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882846625] [2021-12-22 16:32:21,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882846625] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:32:21,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737893786] [2021-12-22 16:32:21,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:21,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:32:21,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:32:21,400 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 16:32:21,402 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 16:32:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:21,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 103 conjunts are in the unsatisfiable core [2021-12-22 16:32:21,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:21,559 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:21,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-22 16:32:21,608 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 16:32:21,669 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-22 16:32:21,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-22 16:32:21,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:21,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-22 16:32:21,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:21,973 INFO L353 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-22 16:32:21,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 64 [2021-12-22 16:32:21,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2021-12-22 16:32:22,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:22,089 INFO L353 Elim1Store]: treesize reduction 152, result has 15.6 percent of original size [2021-12-22 16:32:22,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 84 [2021-12-22 16:32:22,102 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-22 16:32:22,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76 [2021-12-22 16:32:22,351 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-22 16:32:22,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 124 [2021-12-22 16:32:22,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2021-12-22 16:32:22,399 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-22 16:32:22,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 117 [2021-12-22 16:32:22,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2021-12-22 16:32:23,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:23,168 INFO L353 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2021-12-22 16:32:23,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 63 [2021-12-22 16:32:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:23,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:23,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737893786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:23,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 16:32:23,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [25] total 46 [2021-12-22 16:32:23,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179561130] [2021-12-22 16:32:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:23,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-22 16:32:23,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-22 16:32:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1951, Unknown=0, NotChecked=0, Total=2070 [2021-12-22 16:32:23,372 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:24,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:24,500 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-12-22 16:32:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-22 16:32:24,501 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-22 16:32:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:24,502 INFO L225 Difference]: With dead ends: 141 [2021-12-22 16:32:24,502 INFO L226 Difference]: Without dead ends: 141 [2021-12-22 16:32:24,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=257, Invalid=3525, Unknown=0, NotChecked=0, Total=3782 [2021-12-22 16:32:24,503 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:24,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 731 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 310 Invalid, 0 Unknown, 152 Unchecked, 0.2s Time] [2021-12-22 16:32:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-22 16:32:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-12-22 16:32:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 140 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2021-12-22 16:32:24,506 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 36 [2021-12-22 16:32:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:24,506 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2021-12-22 16:32:24,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2021-12-22 16:32:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 16:32:24,506 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:24,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:24,531 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 16:32:24,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-22 16:32:24,715 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1406246583, now seen corresponding path program 1 times [2021-12-22 16:32:24,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:24,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500865320] [2021-12-22 16:32:24,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:24,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:24,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:24,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500865320] [2021-12-22 16:32:24,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500865320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:24,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:24,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:32:24,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113835914] [2021-12-22 16:32:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:24,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:24,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:24,762 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:24,767 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-12-22 16:32:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:24,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-22 16:32:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:24,768 INFO L225 Difference]: With dead ends: 130 [2021-12-22 16:32:24,768 INFO L226 Difference]: Without dead ends: 130 [2021-12-22 16:32:24,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:24,770 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:24,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:32:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-22 16:32:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-12-22 16:32:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.25) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2021-12-22 16:32:24,774 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 36 [2021-12-22 16:32:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:24,774 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2021-12-22 16:32:24,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2021-12-22 16:32:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 16:32:24,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:24,775 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:24,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-22 16:32:24,775 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash -183715591, now seen corresponding path program 1 times [2021-12-22 16:32:24,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:32:24,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126953335] [2021-12-22 16:32:24,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:24,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:32:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:25,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:32:25,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126953335] [2021-12-22 16:32:25,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126953335] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:32:25,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739528677] [2021-12-22 16:32:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:25,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:32:25,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:32:25,434 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 16:32:25,468 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 16:32:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:25,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-22 16:32:25,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:25,598 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:25,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-22 16:32:25,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:32:25,641 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 16:32:25,706 INFO L353 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-12-22 16:32:25,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-12-22 16:32:25,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:25,762 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 16:32:25,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:25,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2021-12-22 16:32:25,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-22 16:32:26,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:26,103 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-22 16:32:26,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 55 [2021-12-22 16:32:26,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:26,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:32:26,175 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-22 16:32:26,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 55 [2021-12-22 16:32:26,382 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-22 16:32:26,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 87 [2021-12-22 16:32:26,421 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-22 16:32:26,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 80 [2021-12-22 16:32:26,835 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 16:32:26,988 INFO L353 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2021-12-22 16:32:26,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 95 treesize of output 73 [2021-12-22 16:32:27,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2021-12-22 16:32:27,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 26 [2021-12-22 16:32:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:27,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:32:27,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-12-22 16:32:27,592 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse1 .cse2) 0) .cse2)))))) is different from false [2021-12-22 16:32:27,603 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) 0))))))) is different from false [2021-12-22 16:32:27,614 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) 0))))))) is different from false [2021-12-22 16:32:27,623 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) 0))))))) is different from false [2021-12-22 16:32:27,636 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse0 .cse1) 0) .cse1))))) (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1))) is different from false [2021-12-22 16:32:27,646 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_1453)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse3 (select (select .cse4 .cse3) 0))))))) is different from false [2021-12-22 16:32:27,659 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse1 (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| .cse5)))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse5)))))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_1453))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) 0)))))) (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse6 (let ((.cse8 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse7 (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| .cse10)))) (store .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse10)))))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8) v_ArrVal_1453))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1))) is different from false [2021-12-22 16:32:27,673 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (select .cse6 .cse2))) (let ((.cse3 (let ((.cse5 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) .cse4))))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse4))))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse2) v_ArrVal_1453))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse7 (let ((.cse10 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse9 (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse12 (select .cse14 .cse10))) (let ((.cse11 (let ((.cse13 (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) .cse12))))) (store .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse12))))))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse10) v_ArrVal_1453))))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse7 .cse8) 0) .cse8)))))) is different from false [2021-12-22 16:32:28,532 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:32:28,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 483 treesize of output 362 [2021-12-22 16:32:28,551 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-22 16:32:28,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 336 treesize of output 334 [2021-12-22 16:32:28,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 314 [2021-12-22 16:32:28,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:32:28,672 INFO L353 Elim1Store]: treesize reduction 153, result has 36.5 percent of original size [2021-12-22 16:32:28,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 395 treesize of output 332 [2021-12-22 16:32:28,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:32:28,725 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-22 16:32:28,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 354 treesize of output 362 [2021-12-22 16:32:28,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:32:28,779 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-22 16:32:28,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 403 treesize of output 397 [2021-12-22 16:32:28,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:32:28,838 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-22 16:32:28,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 416 treesize of output 420 [2021-12-22 16:32:28,856 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-22 16:32:28,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-22 16:32:28,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-22 16:32:28,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309768940] [2021-12-22 16:32:28,857 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-22 16:32:28,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-22 16:32:28,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:32:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-22 16:32:28,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2515, Unknown=56, NotChecked=872, Total=3660 [2021-12-22 16:32:28,858 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 16:32:28,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=217, Invalid=2515, Unknown=56, NotChecked=872, Total=3660 [2021-12-22 16:32:28,860 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 16:32:28,861 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 16:32:28,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 16:32:29,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:32:29,076 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@181c9214 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 16:32:29,079 INFO L158 Benchmark]: Toolchain (without parser) took 26358.28ms. Allocated memory was 92.3MB in the beginning and 163.6MB in the end (delta: 71.3MB). Free memory was 62.5MB in the beginning and 83.0MB in the end (delta: -20.5MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2021-12-22 16:32:29,079 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 92.3MB. Free memory was 49.2MB in the beginning and 49.1MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:32:29,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.55ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 62.5MB in the beginning and 81.4MB in the end (delta: -18.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-22 16:32:29,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.74ms. Allocated memory is still 113.2MB. Free memory was 81.4MB in the beginning and 78.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:32:29,079 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 113.2MB. Free memory was 78.7MB in the beginning and 77.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:32:29,079 INFO L158 Benchmark]: RCFGBuilder took 548.56ms. Allocated memory is still 113.2MB. Free memory was 77.2MB in the beginning and 55.6MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-22 16:32:29,080 INFO L158 Benchmark]: TraceAbstraction took 25316.90ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 55.2MB in the beginning and 83.0MB in the end (delta: -27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-22 16:32:29,081 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 92.3MB. Free memory was 49.2MB in the beginning and 49.1MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.55ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 62.5MB in the beginning and 81.4MB in the end (delta: -18.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.74ms. Allocated memory is still 113.2MB. Free memory was 81.4MB in the beginning and 78.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 113.2MB. Free memory was 78.7MB in the beginning and 77.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.56ms. Allocated memory is still 113.2MB. Free memory was 77.2MB in the beginning and 55.6MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25316.90ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 55.2MB in the beginning and 83.0MB in the end (delta: -27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@181c9214 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@181c9214: 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 16:32:29,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:32:31,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:32:31,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:32:31,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:32:31,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:32:31,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:32:31,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:32:31,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:32:31,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:32:31,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:32:31,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:32:31,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:32:31,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:32:31,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:32:31,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:32:31,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:32:31,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:32:31,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:32:31,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:32:31,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:32:31,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:32:31,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:32:31,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:32:31,197 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:32:31,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:32:31,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:32:31,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:32:31,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:32:31,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:32:31,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:32:31,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:32:31,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:32:31,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:32:31,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:32:31,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:32:31,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:32:31,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:32:31,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:32:31,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:32:31,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:32:31,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:32:31,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-22 16:32:31,256 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:32:31,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:32:31,258 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:32:31,258 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:32:31,259 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:32:31,259 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:32:31,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:32:31,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:32:31,260 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:32:31,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:32:31,261 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:32:31,261 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:32:31,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:32:31,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:32:31,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:32:31,262 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:32:31,262 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:32:31,262 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:32:31,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:32:31,262 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:32:31,263 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-22 16:32:31,263 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-22 16:32:31,263 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:32:31,263 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:32:31,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:32:31,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:32:31,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:32:31,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:32:31,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:32:31,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:32:31,264 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-22 16:32:31,264 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-22 16:32:31,265 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:32:31,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-22 16:32:31,265 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2021-12-22 16:32:31,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:32:31,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:32:31,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:32:31,618 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:32:31,619 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:32:31,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-22 16:32:31,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4083d8e/8e67a8a856594b0a8c923660cef2ab7d/FLAGec1535c5e [2021-12-22 16:32:32,186 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:32:32,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-22 16:32:32,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4083d8e/8e67a8a856594b0a8c923660cef2ab7d/FLAGec1535c5e [2021-12-22 16:32:32,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4083d8e/8e67a8a856594b0a8c923660cef2ab7d [2021-12-22 16:32:32,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:32:32,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:32:32,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:32:32,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:32:32,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:32:32,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:32:32" (1/1) ... [2021-12-22 16:32:32,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b917a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:32, skipping insertion in model container [2021-12-22 16:32:32,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:32:32" (1/1) ... [2021-12-22 16:32:32,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:32:32,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:32:32,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:32:32,990 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:32:33,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:32:33,060 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:32:33,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33 WrapperNode [2021-12-22 16:32:33,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:32:33,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:32:33,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:32:33,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:32:33,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,113 INFO L137 Inliner]: procedures = 128, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 125 [2021-12-22 16:32:33,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:32:33,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:32:33,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:32:33,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:32:33,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:32:33,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:32:33,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:32:33,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:32:33,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (1/1) ... [2021-12-22 16:32:33,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:32:33,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:32:33,217 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 16:32:33,230 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 16:32:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:32:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:32:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:32:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:32:33,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:32:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-22 16:32:33,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:32:33,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:32:33,351 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:32:33,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:32:33,907 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:32:33,914 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:32:33,915 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-22 16:32:33,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:32:33 BoogieIcfgContainer [2021-12-22 16:32:33,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:32:33,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:32:33,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:32:33,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:32:33,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:32:32" (1/3) ... [2021-12-22 16:32:33,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b32053b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:32:33, skipping insertion in model container [2021-12-22 16:32:33,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:33" (2/3) ... [2021-12-22 16:32:33,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b32053b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:32:33, skipping insertion in model container [2021-12-22 16:32:33,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:32:33" (3/3) ... [2021-12-22 16:32:33,923 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2021-12-22 16:32:33,931 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:32:33,932 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-22 16:32:33,979 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:32:33,989 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 16:32:33,989 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-22 16:32:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 61 states have (on average 2.2131147540983607) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:32:34,019 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:34,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:32:34,020 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:34,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 16:32:34,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:34,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700660772] [2021-12-22 16:32:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:34,042 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:34,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:34,047 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 16:32:34,089 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 16:32:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:34,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 16:32:34,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:34,227 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-22 16:32:34,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-22 16:32:34,252 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 16:32:34,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:34,253 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:34,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700660772] [2021-12-22 16:32:34,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700660772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:34,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:34,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:32:34,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681341737] [2021-12-22 16:32:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:34,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:34,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:34,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:34,293 INFO L87 Difference]: Start difference. First operand has 127 states, 61 states have (on average 2.2131147540983607) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:34,592 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-12-22 16:32:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:34,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:32:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:34,608 INFO L225 Difference]: With dead ends: 150 [2021-12-22 16:32:34,608 INFO L226 Difference]: Without dead ends: 148 [2021-12-22 16:32:34,609 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 16:32:34,612 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 114 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:34,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 78 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-22 16:32:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2021-12-22 16:32:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 60 states have (on average 2.033333333333333) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2021-12-22 16:32:34,676 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 3 [2021-12-22 16:32:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:34,677 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2021-12-22 16:32:34,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2021-12-22 16:32:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:32:34,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:34,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:32:34,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:32:34,888 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 16:32:34,888 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:34,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 16:32:34,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:34,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170954797] [2021-12-22 16:32:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:34,890 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:34,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:34,892 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 16:32:34,894 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 16:32:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:34,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 16:32:34,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:34,983 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:34,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2021-12-22 16:32:35,008 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 16:32:35,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:35,010 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170954797] [2021-12-22 16:32:35,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170954797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:35,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:35,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:32:35,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292868492] [2021-12-22 16:32:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:35,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:32:35,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:35,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:32:35,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:32:35,013 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:35,265 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-12-22 16:32:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:32:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 16:32:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:35,267 INFO L225 Difference]: With dead ends: 111 [2021-12-22 16:32:35,267 INFO L226 Difference]: Without dead ends: 111 [2021-12-22 16:32:35,267 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 16:32:35,268 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:35,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 61 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-22 16:32:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-22 16:32:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 60 states have (on average 1.9166666666666667) internal successors, (115), 110 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2021-12-22 16:32:35,280 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 3 [2021-12-22 16:32:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:35,280 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2021-12-22 16:32:35,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2021-12-22 16:32:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 16:32:35,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:35,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:35,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-22 16:32:35,487 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 16:32:35,488 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606480, now seen corresponding path program 1 times [2021-12-22 16:32:35,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:35,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990243984] [2021-12-22 16:32:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:35,489 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:35,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:35,490 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 16:32:35,493 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 16:32:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:35,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 16:32:35,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:35,594 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-22 16:32:35,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-22 16:32:35,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:32:35,667 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-22 16:32:35,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 35 [2021-12-22 16:32:35,724 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:35,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-12-22 16:32:35,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-22 16:32:35,770 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 16:32:35,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:35,770 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:35,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990243984] [2021-12-22 16:32:35,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990243984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:35,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:35,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:35,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754198664] [2021-12-22 16:32:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:35,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:35,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:35,774 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:36,124 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2021-12-22 16:32:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:36,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 16:32:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:36,126 INFO L225 Difference]: With dead ends: 110 [2021-12-22 16:32:36,127 INFO L226 Difference]: Without dead ends: 110 [2021-12-22 16:32:36,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:36,128 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:36,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 262 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-22 16:32:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-22 16:32:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.9) internal successors, (114), 109 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2021-12-22 16:32:36,134 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 10 [2021-12-22 16:32:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:36,134 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2021-12-22 16:32:36,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2021-12-22 16:32:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 16:32:36,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:36,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:36,143 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 16:32:36,343 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 16:32:36,344 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606481, now seen corresponding path program 1 times [2021-12-22 16:32:36,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:36,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456598410] [2021-12-22 16:32:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:36,345 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:36,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:36,346 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 16:32:36,348 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 16:32:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:36,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 16:32:36,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:36,453 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 16:32:36,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-22 16:32:36,479 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-22 16:32:36,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-22 16:32:36,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:32:36,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:32:36,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:36,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:32:36,581 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-22 16:32:36,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-22 16:32:36,631 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-22 16:32:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:36,641 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 16:32:36,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 16:32:36,672 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 16:32:36,693 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 16:32:36,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:36,693 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:36,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456598410] [2021-12-22 16:32:36,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456598410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:36,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:36,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:36,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881165171] [2021-12-22 16:32:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:36,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:36,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:36,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:36,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:36,695 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:37,075 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-12-22 16:32:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:37,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 16:32:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:37,076 INFO L225 Difference]: With dead ends: 109 [2021-12-22 16:32:37,076 INFO L226 Difference]: Without dead ends: 109 [2021-12-22 16:32:37,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:32:37,077 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:37,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 251 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-22 16:32:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-22 16:32:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.8833333333333333) internal successors, (113), 108 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2021-12-22 16:32:37,091 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 10 [2021-12-22 16:32:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:37,091 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2021-12-22 16:32:37,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2021-12-22 16:32:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:32:37,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:37,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:37,099 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 16:32:37,295 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 16:32:37,295 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-12-22 16:32:37,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:37,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815628835] [2021-12-22 16:32:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:37,297 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:37,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:37,297 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 16:32:37,298 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 16:32:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:37,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 16:32:37,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:37,389 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 16:32:37,405 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 16:32:37,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:37,406 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:37,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815628835] [2021-12-22 16:32:37,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815628835] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:37,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:37,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:37,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947434369] [2021-12-22 16:32:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:37,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:37,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:37,407 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:37,616 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2021-12-22 16:32:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:32:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 16:32:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:37,621 INFO L225 Difference]: With dead ends: 108 [2021-12-22 16:32:37,621 INFO L226 Difference]: Without dead ends: 108 [2021-12-22 16:32:37,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:37,622 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 6 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:37,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-22 16:32:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-22 16:32:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 107 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2021-12-22 16:32:37,628 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 11 [2021-12-22 16:32:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:37,628 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2021-12-22 16:32:37,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2021-12-22 16:32:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 16:32:37,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:37,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:37,643 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 16:32:37,837 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 16:32:37,838 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-12-22 16:32:37,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:37,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969966206] [2021-12-22 16:32:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:37,839 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:37,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:37,840 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 16:32:37,840 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 16:32:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:37,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 16:32:37,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:37,960 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 16:32:37,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-22 16:32:37,980 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-22 16:32:37,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-22 16:32:38,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:32:38,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:32:38,073 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-22 16:32:38,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-22 16:32:38,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 16:32:38,112 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:38,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:32:38,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:38,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-22 16:32:38,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 16:32:38,145 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 16:32:38,175 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 16:32:38,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:38,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:38,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969966206] [2021-12-22 16:32:38,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969966206] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:38,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:38,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:38,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452646697] [2021-12-22 16:32:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:38,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:38,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:38,178 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:38,631 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2021-12-22 16:32:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:38,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 16:32:38,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:38,632 INFO L225 Difference]: With dead ends: 107 [2021-12-22 16:32:38,632 INFO L226 Difference]: Without dead ends: 107 [2021-12-22 16:32:38,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:32:38,633 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:38,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:32:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-22 16:32:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-22 16:32:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.85) internal successors, (111), 106 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2021-12-22 16:32:38,637 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 11 [2021-12-22 16:32:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:38,637 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2021-12-22 16:32:38,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2021-12-22 16:32:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:32:38,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:38,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:38,647 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 16:32:38,843 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 16:32:38,844 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:38,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:38,844 INFO L85 PathProgramCache]: Analyzing trace with hash -266592339, now seen corresponding path program 1 times [2021-12-22 16:32:38,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:38,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794454646] [2021-12-22 16:32:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:38,845 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:38,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:38,846 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 16:32:38,847 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 16:32:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:38,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 16:32:38,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:38,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-12-22 16:32:38,969 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 16:32:38,980 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 16:32:39,009 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:39,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-22 16:32:39,147 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:39,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2021-12-22 16:32:39,181 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:39,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-22 16:32:39,213 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 16:32:39,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-12-22 16:32:39,228 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 16:32:39,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:39,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:39,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794454646] [2021-12-22 16:32:39,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794454646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:39,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:39,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:32:39,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954008535] [2021-12-22 16:32:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:39,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:32:39,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:32:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:39,230 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:39,772 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-12-22 16:32:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:32:39,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 16:32:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:39,773 INFO L225 Difference]: With dead ends: 106 [2021-12-22 16:32:39,773 INFO L226 Difference]: Without dead ends: 106 [2021-12-22 16:32:39,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:32:39,774 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 16 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:39,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 465 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 16:32:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-22 16:32:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-22 16:32:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 105 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2021-12-22 16:32:39,778 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 15 [2021-12-22 16:32:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:39,778 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2021-12-22 16:32:39,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2021-12-22 16:32:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:32:39,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:39,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:39,792 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 16:32:39,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:32:39,988 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -266592338, now seen corresponding path program 1 times [2021-12-22 16:32:39,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:39,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137806881] [2021-12-22 16:32:39,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:39,989 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:39,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:39,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:32:39,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-22 16:32:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:40,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-22 16:32:40,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:40,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-12-22 16:32:40,110 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 16:32:40,122 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 16:32:40,166 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:40,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-22 16:32:40,182 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 16:32:40,356 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:40,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-22 16:32:40,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-22 16:32:40,402 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:40,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-22 16:32:40,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-22 16:32:40,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:40,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-12-22 16:32:40,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:32:40,474 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 16:32:40,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:40,474 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:40,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137806881] [2021-12-22 16:32:40,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137806881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:40,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:40,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:32:40,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585828580] [2021-12-22 16:32:40,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:40,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:32:40,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:40,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:32:40,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:40,476 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:41,000 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2021-12-22 16:32:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:32:41,000 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 16:32:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:41,001 INFO L225 Difference]: With dead ends: 105 [2021-12-22 16:32:41,001 INFO L226 Difference]: Without dead ends: 105 [2021-12-22 16:32:41,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:32:41,001 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:41,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 430 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 16:32:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-22 16:32:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-22 16:32:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 104 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2021-12-22 16:32:41,004 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 15 [2021-12-22 16:32:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:41,005 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2021-12-22 16:32:41,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2021-12-22 16:32:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 16:32:41,005 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:41,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:41,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-22 16:32:41,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:32:41,212 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash 325572089, now seen corresponding path program 1 times [2021-12-22 16:32:41,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:41,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633511378] [2021-12-22 16:32:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:41,213 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:41,213 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 16:32:41,214 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 16:32:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:41,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 16:32:41,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:41,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:32:41,346 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 16:32:41,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:41,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:41,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633511378] [2021-12-22 16:32:41,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633511378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:41,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:41,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:32:41,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422230287] [2021-12-22 16:32:41,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:41,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:32:41,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:32:41,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:32:41,349 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:41,577 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-12-22 16:32:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:32:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-22 16:32:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:41,577 INFO L225 Difference]: With dead ends: 104 [2021-12-22 16:32:41,578 INFO L226 Difference]: Without dead ends: 104 [2021-12-22 16:32:41,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:41,578 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:41,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 331 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:32:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-22 16:32:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-22 16:32:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.8) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2021-12-22 16:32:41,581 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 16 [2021-12-22 16:32:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:41,581 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2021-12-22 16:32:41,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2021-12-22 16:32:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 16:32:41,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:41,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:41,593 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 16:32:41,790 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 16:32:41,791 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash 325572090, now seen corresponding path program 1 times [2021-12-22 16:32:41,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:41,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069943295] [2021-12-22 16:32:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:41,795 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:41,796 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 16:32:41,808 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 16:32:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:41,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-22 16:32:41,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:41,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-12-22 16:32:41,940 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 16:32:41,954 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 16:32:41,993 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:41,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-22 16:32:42,003 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 16:32:42,169 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:42,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-22 16:32:42,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-22 16:32:42,215 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:42,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-22 16:32:42,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-22 16:32:42,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:32:42,266 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 16:32:42,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-12-22 16:32:42,296 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 16:32:42,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:42,296 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:42,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069943295] [2021-12-22 16:32:42,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069943295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:42,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:42,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:32:42,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613342851] [2021-12-22 16:32:42,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:42,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:32:42,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:32:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:42,298 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:42,624 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-12-22 16:32:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 16:32:42,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-22 16:32:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:42,626 INFO L225 Difference]: With dead ends: 103 [2021-12-22 16:32:42,626 INFO L226 Difference]: Without dead ends: 103 [2021-12-22 16:32:42,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:32:42,627 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 17 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:42,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 320 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-22 16:32:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-12-22 16:32:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 102 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2021-12-22 16:32:42,629 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 16 [2021-12-22 16:32:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:42,629 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2021-12-22 16:32:42,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2021-12-22 16:32:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:32:42,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:42,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:42,641 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 16:32:42,830 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 16:32:42,831 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:42,831 INFO L85 PathProgramCache]: Analyzing trace with hash -819039076, now seen corresponding path program 1 times [2021-12-22 16:32:42,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:42,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684086247] [2021-12-22 16:32:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:42,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:42,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:42,832 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 16:32:42,837 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 16:32:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:42,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 16:32:42,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:42,981 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 16:32:42,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:42,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:42,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684086247] [2021-12-22 16:32:42,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684086247] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:42,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:42,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:42,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138311069] [2021-12-22 16:32:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:42,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:42,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:42,984 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:43,360 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2021-12-22 16:32:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:43,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 16:32:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:43,362 INFO L225 Difference]: With dead ends: 163 [2021-12-22 16:32:43,362 INFO L226 Difference]: Without dead ends: 163 [2021-12-22 16:32:43,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:43,363 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 339 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:43,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 145 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-22 16:32:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 101. [2021-12-22 16:32:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 100 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2021-12-22 16:32:43,366 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 20 [2021-12-22 16:32:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:43,366 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2021-12-22 16:32:43,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2021-12-22 16:32:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:32:43,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:43,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:43,380 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 16:32:43,567 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 16:32:43,567 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash -819039075, now seen corresponding path program 1 times [2021-12-22 16:32:43,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:43,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200425066] [2021-12-22 16:32:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:43,568 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:43,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:43,569 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 16:32:43,570 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 16:32:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:43,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 16:32:43,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:43,778 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 16:32:43,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:43,778 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:43,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200425066] [2021-12-22 16:32:43,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200425066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:43,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:43,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:43,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685719535] [2021-12-22 16:32:43,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:43,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:43,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:43,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:43,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:43,779 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:44,127 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2021-12-22 16:32:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:44,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 16:32:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:44,135 INFO L225 Difference]: With dead ends: 134 [2021-12-22 16:32:44,135 INFO L226 Difference]: Without dead ends: 134 [2021-12-22 16:32:44,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:32:44,136 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 437 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:44,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 107 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-22 16:32:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2021-12-22 16:32:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 98 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2021-12-22 16:32:44,138 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 20 [2021-12-22 16:32:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:44,139 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2021-12-22 16:32:44,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2021-12-22 16:32:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 16:32:44,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:44,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:44,151 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 16:32:44,348 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 16:32:44,349 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash 379593084, now seen corresponding path program 1 times [2021-12-22 16:32:44,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:44,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331972805] [2021-12-22 16:32:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:44,350 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:44,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:44,351 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 16:32:44,353 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 16:32:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:44,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 16:32:44,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:44,493 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 16:32:44,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:44,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:44,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331972805] [2021-12-22 16:32:44,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331972805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:44,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:44,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:44,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956878816] [2021-12-22 16:32:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:44,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:32:44,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:44,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:32:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:32:44,495 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:44,854 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2021-12-22 16:32:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 16:32:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:44,855 INFO L225 Difference]: With dead ends: 120 [2021-12-22 16:32:44,855 INFO L226 Difference]: Without dead ends: 120 [2021-12-22 16:32:44,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:32:44,856 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 282 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:44,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 114 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-22 16:32:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2021-12-22 16:32:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-12-22 16:32:44,859 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 21 [2021-12-22 16:32:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:44,859 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-12-22 16:32:44,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-12-22 16:32:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 16:32:44,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:44,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:44,875 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 16:32:45,075 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 16:32:45,075 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 379593085, now seen corresponding path program 1 times [2021-12-22 16:32:45,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:45,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206984751] [2021-12-22 16:32:45,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:45,076 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:45,077 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 16:32:45,078 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 16:32:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:45,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 16:32:45,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:45,297 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 16:32:45,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:45,298 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206984751] [2021-12-22 16:32:45,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206984751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:45,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:45,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 16:32:45,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167733274] [2021-12-22 16:32:45,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:45,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:45,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:45,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:45,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:45,299 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:45,610 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-12-22 16:32:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:32:45,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 16:32:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:45,611 INFO L225 Difference]: With dead ends: 91 [2021-12-22 16:32:45,611 INFO L226 Difference]: Without dead ends: 91 [2021-12-22 16:32:45,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:32:45,612 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 264 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:45,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 74 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:32:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-22 16:32:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-22 16:32:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-12-22 16:32:45,614 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 21 [2021-12-22 16:32:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:45,614 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-12-22 16:32:45,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-12-22 16:32:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 16:32:45,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:45,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:45,622 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 16:32:45,819 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 16:32:45,819 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:45,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:45,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1117536095, now seen corresponding path program 1 times [2021-12-22 16:32:45,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:45,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243801083] [2021-12-22 16:32:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:45,820 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:45,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:45,822 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 16:32:45,824 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 16:32:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:45,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-22 16:32:45,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:45,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-12-22 16:32:45,988 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 16:32:46,016 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:32:46,016 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 16:32:46,044 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:46,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-22 16:32:46,155 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:46,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2021-12-22 16:32:46,207 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:46,208 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 16:32:46,327 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:46,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2021-12-22 16:32:46,359 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:46,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-22 16:32:46,471 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 16:32:46,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2021-12-22 16:32:46,517 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 16:32:46,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:46,517 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:46,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243801083] [2021-12-22 16:32:46,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243801083] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:46,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:46,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-22 16:32:46,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981316287] [2021-12-22 16:32:46,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:46,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-22 16:32:46,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:46,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-22 16:32:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-12-22 16:32:46,519 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:48,226 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-12-22 16:32:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 16:32:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-22 16:32:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:48,227 INFO L225 Difference]: With dead ends: 154 [2021-12-22 16:32:48,227 INFO L226 Difference]: Without dead ends: 154 [2021-12-22 16:32:48,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2021-12-22 16:32:48,228 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 354 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:48,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 592 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-22 16:32:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-22 16:32:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 91. [2021-12-22 16:32:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 90 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-22 16:32:48,232 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 22 [2021-12-22 16:32:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:48,232 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-22 16:32:48,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-22 16:32:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 16:32:48,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:48,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:48,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-22 16:32:48,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:32:48,444 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1117536094, now seen corresponding path program 1 times [2021-12-22 16:32:48,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:48,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683430704] [2021-12-22 16:32:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:48,445 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:48,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:48,447 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:32:48,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-22 16:32:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:48,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-22 16:32:48,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:48,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-12-22 16:32:48,665 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 16:32:48,691 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:32:48,691 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 16:32:48,721 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:48,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-22 16:32:48,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:32:48,909 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:48,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-12-22 16:32:48,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-12-22 16:32:49,023 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:49,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2021-12-22 16:32:49,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2021-12-22 16:32:49,380 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:49,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2021-12-22 16:32:49,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2021-12-22 16:32:49,447 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:49,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-22 16:32:49,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2021-12-22 16:32:49,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:32:49,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2021-12-22 16:32:49,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2021-12-22 16:32:50,046 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 16:32:50,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:50,046 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:50,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683430704] [2021-12-22 16:32:50,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683430704] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:50,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:50,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-22 16:32:50,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088201173] [2021-12-22 16:32:50,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:50,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-22 16:32:50,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-22 16:32:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-12-22 16:32:50,048 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:55,078 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-12-22 16:32:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 16:32:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-22 16:32:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:55,079 INFO L225 Difference]: With dead ends: 149 [2021-12-22 16:32:55,079 INFO L226 Difference]: Without dead ends: 149 [2021-12-22 16:32:55,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2021-12-22 16:32:55,082 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 366 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:55,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 506 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-22 16:32:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-22 16:32:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 100. [2021-12-22 16:32:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.5) internal successors, (111), 99 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2021-12-22 16:32:55,086 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 22 [2021-12-22 16:32:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:55,086 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-12-22 16:32:55,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2021-12-22 16:32:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-22 16:32:55,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:55,087 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:55,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-22 16:32:55,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:32:55,301 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash -191213837, now seen corresponding path program 1 times [2021-12-22 16:32:55,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:55,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253283010] [2021-12-22 16:32:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:55,302 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:55,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:55,303 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 16:32:55,304 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 16:32:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:55,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 16:32:55,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:32:55,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:55,710 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:55,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253283010] [2021-12-22 16:32:55,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253283010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:55,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:55,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:32:55,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717807358] [2021-12-22 16:32:55,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:55,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:32:55,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:55,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:32:55,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:55,712 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:55,719 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2021-12-22 16:32:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:32:55,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-22 16:32:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:55,720 INFO L225 Difference]: With dead ends: 106 [2021-12-22 16:32:55,720 INFO L226 Difference]: Without dead ends: 106 [2021-12-22 16:32:55,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:32:55,721 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:55,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 344 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2021-12-22 16:32:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-22 16:32:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2021-12-22 16:32:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.481012658227848) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-22 16:32:55,724 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2021-12-22 16:32:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:55,724 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-22 16:32:55,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-22 16:32:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:32:55,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:55,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:55,735 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 16:32:55,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:32:55,934 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:55,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash 928212027, now seen corresponding path program 1 times [2021-12-22 16:32:55,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:55,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618493606] [2021-12-22 16:32:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:55,935 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:55,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:55,936 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:32:55,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-22 16:32:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:56,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-22 16:32:56,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:56,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-12-22 16:32:56,097 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 16:32:56,115 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:32:56,116 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 16:32:56,143 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:56,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-22 16:32:56,271 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:56,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2021-12-22 16:32:56,315 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:56,315 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 16:32:56,476 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:56,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2021-12-22 16:32:56,506 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:56,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-22 16:32:56,711 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 16:32:56,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2021-12-22 16:32:56,734 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 16:32:56,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:32:56,734 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:32:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618493606] [2021-12-22 16:32:56,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618493606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:32:56,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:32:56,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-22 16:32:56,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610966521] [2021-12-22 16:32:56,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:32:56,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 16:32:56,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:32:56,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 16:32:56,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-12-22 16:32:56,738 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:58,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:32:58,189 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2021-12-22 16:32:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:32:58,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-22 16:32:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:32:58,190 INFO L225 Difference]: With dead ends: 141 [2021-12-22 16:32:58,190 INFO L226 Difference]: Without dead ends: 141 [2021-12-22 16:32:58,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2021-12-22 16:32:58,191 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 239 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:32:58,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 471 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-22 16:32:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-22 16:32:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2021-12-22 16:32:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2021-12-22 16:32:58,194 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 26 [2021-12-22 16:32:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:32:58,199 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2021-12-22 16:32:58,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:32:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2021-12-22 16:32:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:32:58,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:32:58,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:32:58,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-22 16:32:58,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:32:58,403 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-22 16:32:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:32:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash 928212028, now seen corresponding path program 1 times [2021-12-22 16:32:58,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:32:58,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460414153] [2021-12-22 16:32:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:32:58,404 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:32:58,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:32:58,405 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 16:32:58,411 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 16:32:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:32:58,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-22 16:32:58,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:32:58,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-12-22 16:32:58,583 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 16:32:58,602 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:32:58,602 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 16:32:58,627 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 16:32:58,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-22 16:32:58,768 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:58,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-12-22 16:32:58,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-12-22 16:32:58,880 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:58,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2021-12-22 16:32:58,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2021-12-22 16:32:59,313 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:59,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2021-12-22 16:32:59,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2021-12-22 16:32:59,377 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:32:59,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-22 16:32:59,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50