./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:50:47,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:50:47,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:50:47,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:50:47,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:50:47,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:50:47,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:50:47,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:50:47,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:50:47,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:50:47,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:50:47,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:50:47,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:50:47,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:50:47,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:50:47,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:50:47,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:50:47,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:50:47,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:50:47,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:50:47,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:50:47,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:50:47,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:50:47,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:50:47,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:50:47,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:50:47,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:50:47,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:50:47,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:50:47,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:50:47,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:50:47,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:50:47,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:50:47,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:50:47,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:50:47,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:50:47,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:50:47,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:50:47,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:50:47,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:50:47,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:50:47,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:50:47,891 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:50:47,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:50:47,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:50:47,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:50:47,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:50:47,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:50:47,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:50:47,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:50:47,894 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:50:47,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:50:47,894 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:50:47,895 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:50:47,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:50:47,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:50:47,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:50:47,895 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:50:47,895 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:50:47,895 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:50:47,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:50:47,896 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:50:47,896 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:50:47,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:50:47,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:50:47,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:50:47,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:50:47,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:50:47,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:50:47,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:50:47,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:50:47,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:50:47,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:50:47,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2021-12-14 19:50:48,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:50:48,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:50:48,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:50:48,084 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:50:48,085 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:50:48,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-14 19:50:48,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f321c22/9a0bb211ea164edd9e720851a9d5b8aa/FLAGe2eb02a41 [2021-12-14 19:50:48,488 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:50:48,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-14 19:50:48,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f321c22/9a0bb211ea164edd9e720851a9d5b8aa/FLAGe2eb02a41 [2021-12-14 19:50:48,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f321c22/9a0bb211ea164edd9e720851a9d5b8aa [2021-12-14 19:50:48,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:50:48,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:50:48,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:50:48,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:50:48,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:50:48,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:50:48" (1/1) ... [2021-12-14 19:50:48,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa0db16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:48, skipping insertion in model container [2021-12-14 19:50:48,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:50:48" (1/1) ... [2021-12-14 19:50:48,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:50:48,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:50:49,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-14 19:50:49,164 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:50:49,168 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:50:49,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-14 19:50:49,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:50:49,218 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:50:49,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49 WrapperNode [2021-12-14 19:50:49,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:50:49,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:50:49,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:50:49,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:50:49,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,252 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-14 19:50:49,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:50:49,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:50:49,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:50:49,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:50:49,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:50:49,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:50:49,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:50:49,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:50:49,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (1/1) ... [2021-12-14 19:50:49,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:50:49,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:49,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:50:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:50:49,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:50:49,341 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-14 19:50:49,341 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-14 19:50:49,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:50:49,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:50:49,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:50:49,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:50:49,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:50:49,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:50:49,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:50:49,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:50:49,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:50:49,408 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:50:49,409 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:50:49,583 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:50:49,588 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:50:49,588 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 19:50:49,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:50:49 BoogieIcfgContainer [2021-12-14 19:50:49,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:50:49,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:50:49,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:50:49,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:50:49,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:50:48" (1/3) ... [2021-12-14 19:50:49,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336312ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:50:49, skipping insertion in model container [2021-12-14 19:50:49,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:50:49" (2/3) ... [2021-12-14 19:50:49,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336312ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:50:49, skipping insertion in model container [2021-12-14 19:50:49,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:50:49" (3/3) ... [2021-12-14 19:50:49,596 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-14 19:50:49,600 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:50:49,601 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-14 19:50:49,630 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:50:49,635 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:50:49,636 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-14 19:50:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:50:49,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:49,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:50:49,662 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:49,666 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-14 19:50:49,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:49,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851345087] [2021-12-14 19:50:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:49,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:49,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:49,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851345087] [2021-12-14 19:50:49,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851345087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:49,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:49,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:50:49,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887047521] [2021-12-14 19:50:49,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:49,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:50:49,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:49,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:50:49,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:49,868 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:49,923 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-14 19:50:49,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:50:49,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:50:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:49,930 INFO L225 Difference]: With dead ends: 81 [2021-12-14 19:50:49,930 INFO L226 Difference]: Without dead ends: 78 [2021-12-14 19:50:49,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:49,933 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:49,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-14 19:50:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-14 19:50:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-14 19:50:49,959 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-14 19:50:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:49,960 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-14 19:50:49,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-14 19:50:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:50:49,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:49,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:50:49,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:50:49,961 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-14 19:50:49,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:49,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883743080] [2021-12-14 19:50:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:49,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:49,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:49,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883743080] [2021-12-14 19:50:49,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883743080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:49,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:49,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:50:49,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958288770] [2021-12-14 19:50:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:49,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:50:49,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:50:50,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:50,000 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:50,030 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-14 19:50:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:50:50,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:50:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:50,032 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:50:50,032 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:50:50,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:50:50,033 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:50,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:50:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-14 19:50:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-14 19:50:50,039 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-14 19:50:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:50,040 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-14 19:50:50,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:50:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-14 19:50:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:50:50,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:50,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:50,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:50:50,041 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-14 19:50:50,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:50,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720645546] [2021-12-14 19:50:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:50,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:50,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720645546] [2021-12-14 19:50:50,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720645546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:50,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:50,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:50:50,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549670423] [2021-12-14 19:50:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:50,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:50:50,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:50,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:50:50,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:50:50,104 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:50:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:50,149 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-14 19:50:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:50:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-14 19:50:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:50,151 INFO L225 Difference]: With dead ends: 83 [2021-12-14 19:50:50,151 INFO L226 Difference]: Without dead ends: 83 [2021-12-14 19:50:50,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:50:50,152 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:50,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-14 19:50:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-14 19:50:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-14 19:50:50,169 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-14 19:50:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:50,170 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-14 19:50:50,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:50:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-14 19:50:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:50:50,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:50,171 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:50,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:50:50,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-14 19:50:50,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570721496] [2021-12-14 19:50:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:50,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:50:50,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:50,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570721496] [2021-12-14 19:50:50,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570721496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:50,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:50,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:50,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986777490] [2021-12-14 19:50:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:50,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:50,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:50,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:50,330 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:50,458 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-14 19:50:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:50,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-14 19:50:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:50,463 INFO L225 Difference]: With dead ends: 97 [2021-12-14 19:50:50,463 INFO L226 Difference]: Without dead ends: 97 [2021-12-14 19:50:50,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:50:50,471 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:50,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-14 19:50:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-14 19:50:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-14 19:50:50,481 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-14 19:50:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:50,481 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-14 19:50:50,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-14 19:50:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:50:50,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:50,482 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:50,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:50:50,483 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:50,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:50,483 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-14 19:50:50,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:50,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163360362] [2021-12-14 19:50:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:50,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:50,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163360362] [2021-12-14 19:50:50,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163360362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:50,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:50,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:50:50,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715338954] [2021-12-14 19:50:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:50,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:50,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:50,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:50,576 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:50,662 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-14 19:50:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:50,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-14 19:50:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:50,663 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:50:50,663 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:50:50,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:50:50,664 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:50,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:50:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-14 19:50:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-14 19:50:50,667 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-14 19:50:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:50,668 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-14 19:50:50,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-14 19:50:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:50:50,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:50,669 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:50,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:50:50,669 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-14 19:50:50,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:50,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501790427] [2021-12-14 19:50:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:50,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:50:50,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501790427] [2021-12-14 19:50:50,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501790427] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002703261] [2021-12-14 19:50:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:50,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:50,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:50,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:50:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:50,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:50:50,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:50,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:51,063 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:50:51,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:50:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:51,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:51,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002703261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:51,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:50:51,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-14 19:50:51,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738222035] [2021-12-14 19:50:51,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:51,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:50:51,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:51,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:50:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:50:51,126 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:50:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:51,222 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-14 19:50:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:50:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-14 19:50:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:51,223 INFO L225 Difference]: With dead ends: 94 [2021-12-14 19:50:51,223 INFO L226 Difference]: Without dead ends: 94 [2021-12-14 19:50:51,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:50:51,224 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:51,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2021-12-14 19:50:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-14 19:50:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2021-12-14 19:50:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-12-14 19:50:51,228 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2021-12-14 19:50:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:51,228 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-12-14 19:50:51,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:50:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-12-14 19:50:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:50:51,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:51,229 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:51,259 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-14 19:50:51,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 19:50:51,446 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:51,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:51,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-14 19:50:51,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:51,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833052813] [2021-12-14 19:50:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:51,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:51,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:51,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833052813] [2021-12-14 19:50:51,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833052813] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:51,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790161155] [2021-12-14 19:50:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:51,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:51,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:51,639 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-14 19:50:51,640 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-14 19:50:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:51,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 19:50:51,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:51,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:51,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:51,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:50:51,926 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:51,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:51,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:52,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790161155] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:52,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:50:52,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-14 19:50:52,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946645095] [2021-12-14 19:50:52,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:52,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:50:52,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:52,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:50:52,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:50:52,050 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:50:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:52,244 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-12-14 19:50:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:50:52,245 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-12-14 19:50:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:52,246 INFO L225 Difference]: With dead ends: 94 [2021-12-14 19:50:52,246 INFO L226 Difference]: Without dead ends: 94 [2021-12-14 19:50:52,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-12-14 19:50:52,246 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 176 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:52,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 450 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2021-12-14 19:50:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-14 19:50:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2021-12-14 19:50:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2021-12-14 19:50:52,250 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2021-12-14 19:50:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:52,250 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2021-12-14 19:50:52,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:50:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2021-12-14 19:50:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:50:52,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:52,251 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:52,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:52,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-14 19:50:52,459 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-14 19:50:52,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:52,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144942473] [2021-12-14 19:50:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:52,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:50:52,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:52,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144942473] [2021-12-14 19:50:52,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144942473] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:52,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:52,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:50:52,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550567226] [2021-12-14 19:50:52,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:52,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:50:52,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:52,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:50:52,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:52,550 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:52,764 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-14 19:50:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:50:52,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-14 19:50:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:52,765 INFO L225 Difference]: With dead ends: 142 [2021-12-14 19:50:52,765 INFO L226 Difference]: Without dead ends: 142 [2021-12-14 19:50:52,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:50:52,766 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:52,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:50:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-14 19:50:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2021-12-14 19:50:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-12-14 19:50:52,769 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2021-12-14 19:50:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:52,770 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-12-14 19:50:52,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-12-14 19:50:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:50:52,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:52,770 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:52,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:50:52,770 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2021-12-14 19:50:52,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:52,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378040980] [2021-12-14 19:50:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:52,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:52,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:52,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:52,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378040980] [2021-12-14 19:50:52,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378040980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:52,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:52,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:50:52,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105041189] [2021-12-14 19:50:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:52,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:50:52,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:52,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:50:52,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:52,883 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:53,091 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2021-12-14 19:50:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:50:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-14 19:50:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:53,092 INFO L225 Difference]: With dead ends: 123 [2021-12-14 19:50:53,092 INFO L226 Difference]: Without dead ends: 123 [2021-12-14 19:50:53,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:50:53,093 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 323 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:53,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 485 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-14 19:50:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2021-12-14 19:50:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2021-12-14 19:50:53,096 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 30 [2021-12-14 19:50:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:53,096 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2021-12-14 19:50:53,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2021-12-14 19:50:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:50:53,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:53,097 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:53,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:50:53,097 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:53,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:53,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2021-12-14 19:50:53,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:53,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474423286] [2021-12-14 19:50:53,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:53,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:50:53,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:53,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474423286] [2021-12-14 19:50:53,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474423286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:53,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:53,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:50:53,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692400769] [2021-12-14 19:50:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:53,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:50:53,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:50:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:50:53,159 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:53,196 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-12-14 19:50:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:50:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-14 19:50:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:53,197 INFO L225 Difference]: With dead ends: 105 [2021-12-14 19:50:53,197 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 19:50:53,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:50:53,198 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 84 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:53,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 188 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 19:50:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2021-12-14 19:50:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.490909090909091) internal successors, (82), 74 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2021-12-14 19:50:53,201 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 32 [2021-12-14 19:50:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:53,201 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2021-12-14 19:50:53,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2021-12-14 19:50:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:50:53,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:53,202 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:53,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:50:53,202 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-14 19:50:53,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:53,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056228999] [2021-12-14 19:50:53,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:53,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:50:53,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:53,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056228999] [2021-12-14 19:50:53,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056228999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:53,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:53,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:50:53,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236012401] [2021-12-14 19:50:53,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:53,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:50:53,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:50:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:50:53,251 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:53,293 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2021-12-14 19:50:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:50:53,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-14 19:50:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:53,294 INFO L225 Difference]: With dead ends: 154 [2021-12-14 19:50:53,294 INFO L226 Difference]: Without dead ends: 154 [2021-12-14 19:50:53,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:50:53,295 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 98 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:53,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 258 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-14 19:50:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 79. [2021-12-14 19:50:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2021-12-14 19:50:53,297 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 33 [2021-12-14 19:50:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:53,297 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2021-12-14 19:50:53,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2021-12-14 19:50:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:50:53,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:53,298 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:53,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:50:53,298 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 274321506, now seen corresponding path program 1 times [2021-12-14 19:50:53,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:53,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923802977] [2021-12-14 19:50:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:53,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:50:53,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:53,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923802977] [2021-12-14 19:50:53,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923802977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:53,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:53,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:50:53,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435996133] [2021-12-14 19:50:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:53,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:50:53,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:50:53,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:50:53,339 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:53,377 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2021-12-14 19:50:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:50:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-12-14 19:50:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:53,378 INFO L225 Difference]: With dead ends: 119 [2021-12-14 19:50:53,378 INFO L226 Difference]: Without dead ends: 119 [2021-12-14 19:50:53,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:50:53,378 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:53,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 258 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-14 19:50:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 80. [2021-12-14 19:50:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 76 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2021-12-14 19:50:53,381 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 37 [2021-12-14 19:50:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:53,381 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2021-12-14 19:50:53,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2021-12-14 19:50:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:50:53,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:53,382 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:53,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:50:53,382 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:53,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash 274321451, now seen corresponding path program 1 times [2021-12-14 19:50:53,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:53,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986201344] [2021-12-14 19:50:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:53,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 19:50:53,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:53,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986201344] [2021-12-14 19:50:53,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986201344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:50:53,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:50:53,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:50:53,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832407678] [2021-12-14 19:50:53,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:50:53,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:50:53,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:50:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:53,456 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:53,618 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2021-12-14 19:50:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:50:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2021-12-14 19:50:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:53,619 INFO L225 Difference]: With dead ends: 106 [2021-12-14 19:50:53,619 INFO L226 Difference]: Without dead ends: 106 [2021-12-14 19:50:53,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:50:53,620 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 291 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:53,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 319 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-14 19:50:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2021-12-14 19:50:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5) internal successors, (90), 79 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2021-12-14 19:50:53,622 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 37 [2021-12-14 19:50:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:53,622 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2021-12-14 19:50:53,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:50:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2021-12-14 19:50:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:50:53,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:53,623 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:53,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:50:53,624 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 274321452, now seen corresponding path program 1 times [2021-12-14 19:50:53,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:53,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529228369] [2021-12-14 19:50:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:53,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:50:53,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:53,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529228369] [2021-12-14 19:50:53,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529228369] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:53,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656789355] [2021-12-14 19:50:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:53,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:53,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:53,696 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-14 19:50:53,697 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-14 19:50:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:53,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:50:53,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:50:53,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:50:53,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656789355] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:53,925 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:53,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-14 19:50:53,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61972367] [2021-12-14 19:50:53,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:53,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:50:53,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:53,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:50:53,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:53,927 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:50:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:53,976 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2021-12-14 19:50:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:50:53,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2021-12-14 19:50:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:53,977 INFO L225 Difference]: With dead ends: 96 [2021-12-14 19:50:53,977 INFO L226 Difference]: Without dead ends: 96 [2021-12-14 19:50:53,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:50:53,978 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 161 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:53,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 306 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:50:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-14 19:50:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2021-12-14 19:50:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2021-12-14 19:50:53,980 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 37 [2021-12-14 19:50:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:53,980 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2021-12-14 19:50:53,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:50:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2021-12-14 19:50:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:50:53,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:53,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:54,012 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-14 19:50:54,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:54,195 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2021-12-14 19:50:54,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:54,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887996324] [2021-12-14 19:50:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:54,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:54,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:54,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887996324] [2021-12-14 19:50:54,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887996324] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:54,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690639647] [2021-12-14 19:50:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:54,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:54,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:54,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:54,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:50:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:54,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-14 19:50:54,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:54,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:54,736 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:54,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:54,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:50:54,796 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:54,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:50:54,937 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:50:54,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-14 19:50:55,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:55,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:55,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-14 19:50:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:55,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:56,235 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-14 19:50:56,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 19:50:56,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| Int) (v_ArrVal_1010 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|))) is different from false [2021-12-14 19:50:56,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| Int) (v_ArrVal_1010 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)))) is different from false [2021-12-14 19:50:56,275 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:56,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:50:56,283 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:56,283 INFO L388 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 30 treesize of output 30 [2021-12-14 19:50:56,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 19:50:56,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690639647] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:56,462 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:50:56,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2021-12-14 19:50:56,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935151352] [2021-12-14 19:50:56,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:56,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-14 19:50:56,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-14 19:50:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1241, Unknown=2, NotChecked=142, Total=1482 [2021-12-14 19:50:56,464 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:57,150 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2021-12-14 19:50:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 19:50:57,150 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2021-12-14 19:50:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:57,151 INFO L225 Difference]: With dead ends: 173 [2021-12-14 19:50:57,151 INFO L226 Difference]: Without dead ends: 173 [2021-12-14 19:50:57,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=202, Invalid=1966, Unknown=2, NotChecked=182, Total=2352 [2021-12-14 19:50:57,152 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 104 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:57,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 1876 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 914 Invalid, 0 Unknown, 119 Unchecked, 0.3s Time] [2021-12-14 19:50:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-14 19:50:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2021-12-14 19:50:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 108 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:50:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2021-12-14 19:50:57,154 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 38 [2021-12-14 19:50:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:57,155 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2021-12-14 19:50:57,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2021-12-14 19:50:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:50:57,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:57,155 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:57,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-14 19:50:57,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 19:50:57,363 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:50:57,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2021-12-14 19:50:57,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:57,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397592749] [2021-12-14 19:50:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:57,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:57,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:50:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:57,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397592749] [2021-12-14 19:50:57,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397592749] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:57,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876081968] [2021-12-14 19:50:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:57,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:57,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:57,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:57,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:50:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:58,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-14 19:50:58,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:58,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:50:58,375 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:50:58,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 19:50:58,391 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:58,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:50:58,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:50:58,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:50:58,608 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:58,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-14 19:50:58,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2021-12-14 19:50:58,810 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:50:58,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-14 19:50:58,820 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:50:58,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-14 19:50:59,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-12-14 19:50:59,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:50:59,127 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-14 19:50:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:59,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:07,845 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:07,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-14 19:51:07,850 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:07,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 66 [2021-12-14 19:51:07,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2021-12-14 19:51:07,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 162 [2021-12-14 19:51:07,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:07,866 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:07,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 147 [2021-12-14 19:51:07,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:07,874 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:07,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 139 [2021-12-14 19:51:07,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:07,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2021-12-14 19:51:07,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:07,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2021-12-14 19:51:07,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:07,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2021-12-14 19:51:08,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876081968] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:08,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:51:08,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2021-12-14 19:51:08,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557397300] [2021-12-14 19:51:08,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:08,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-14 19:51:08,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-14 19:51:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3019, Unknown=5, NotChecked=0, Total=3192 [2021-12-14 19:51:08,231 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 38 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:51:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:09,368 INFO L93 Difference]: Finished difference Result 172 states and 199 transitions. [2021-12-14 19:51:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:51:09,369 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 38 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2021-12-14 19:51:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:09,369 INFO L225 Difference]: With dead ends: 172 [2021-12-14 19:51:09,369 INFO L226 Difference]: Without dead ends: 172 [2021-12-14 19:51:09,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=313, Invalid=4374, Unknown=5, NotChecked=0, Total=4692 [2021-12-14 19:51:09,371 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 186 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:09,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 2626 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1074 Invalid, 0 Unknown, 219 Unchecked, 0.4s Time] [2021-12-14 19:51:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-14 19:51:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 110. [2021-12-14 19:51:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 105 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2021-12-14 19:51:09,373 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 38 [2021-12-14 19:51:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:09,373 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2021-12-14 19:51:09,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 38 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:51:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2021-12-14 19:51:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:51:09,374 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:09,374 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:09,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:09,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 19:51:09,583 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash 766820837, now seen corresponding path program 2 times [2021-12-14 19:51:09,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:09,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211763027] [2021-12-14 19:51:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:09,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:09,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:09,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211763027] [2021-12-14 19:51:09,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211763027] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:09,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064174538] [2021-12-14 19:51:09,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:51:09,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:09,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:09,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:51:09,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:51:09,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:51:09,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:51:09,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:51:09,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:51:09,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064174538] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:09,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:09,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-14 19:51:09,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417500953] [2021-12-14 19:51:09,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:09,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:51:09,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:51:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:51:09,966 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:51:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:10,045 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2021-12-14 19:51:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:51:10,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-14 19:51:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:10,046 INFO L225 Difference]: With dead ends: 111 [2021-12-14 19:51:10,046 INFO L226 Difference]: Without dead ends: 111 [2021-12-14 19:51:10,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:51:10,046 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 219 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:10,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 243 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-14 19:51:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2021-12-14 19:51:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 103 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2021-12-14 19:51:10,049 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 41 [2021-12-14 19:51:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:10,049 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2021-12-14 19:51:10,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:51:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2021-12-14 19:51:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:51:10,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:10,050 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:10,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-14 19:51:10,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 19:51:10,260 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -168412912, now seen corresponding path program 2 times [2021-12-14 19:51:10,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:10,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732838863] [2021-12-14 19:51:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:10,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:10,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:10,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732838863] [2021-12-14 19:51:10,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732838863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:10,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073549018] [2021-12-14 19:51:10,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:51:10,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:10,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:10,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:51:10,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 19:51:10,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:51:10,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-14 19:51:10,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:10,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:10,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073549018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:10,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:51:10,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2021-12-14 19:51:10,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016855791] [2021-12-14 19:51:10,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:10,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:51:10,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:10,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:51:10,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:51:10,666 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:10,847 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2021-12-14 19:51:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:51:10,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-14 19:51:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:10,848 INFO L225 Difference]: With dead ends: 142 [2021-12-14 19:51:10,848 INFO L226 Difference]: Without dead ends: 142 [2021-12-14 19:51:10,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-12-14 19:51:10,849 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 427 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:10,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 278 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-14 19:51:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2021-12-14 19:51:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 103 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2021-12-14 19:51:10,857 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 42 [2021-12-14 19:51:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:10,857 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2021-12-14 19:51:10,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2021-12-14 19:51:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:51:10,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:10,859 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:10,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:11,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:11,070 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:11,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash -885972099, now seen corresponding path program 3 times [2021-12-14 19:51:11,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:11,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860714704] [2021-12-14 19:51:11,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:11,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:51:11,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:11,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860714704] [2021-12-14 19:51:11,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860714704] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:11,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527626105] [2021-12-14 19:51:11,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:51:11,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:11,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:11,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:11,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 19:51:11,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 19:51:11,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:51:11,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:51:11,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:51:11,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:11,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527626105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:11,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:51:11,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-12-14 19:51:11,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211180925] [2021-12-14 19:51:11,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:11,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:11,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:11,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:11,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:51:11,466 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:11,513 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2021-12-14 19:51:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:11,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2021-12-14 19:51:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:11,514 INFO L225 Difference]: With dead ends: 110 [2021-12-14 19:51:11,514 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 19:51:11,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:51:11,515 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 141 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:11,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 138 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 19:51:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2021-12-14 19:51:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.302325581395349) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2021-12-14 19:51:11,518 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 43 [2021-12-14 19:51:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:11,518 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2021-12-14 19:51:11,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2021-12-14 19:51:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:51:11,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:11,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:11,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:11,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:11,739 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash 790743329, now seen corresponding path program 1 times [2021-12-14 19:51:11,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:11,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793525257] [2021-12-14 19:51:11,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:11,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:11,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:11,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:11,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793525257] [2021-12-14 19:51:11,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793525257] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:11,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370031207] [2021-12-14 19:51:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:11,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:11,832 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:11,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 19:51:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:11,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:51:11,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:12,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:12,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370031207] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:12,113 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:12,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-14 19:51:12,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7748026] [2021-12-14 19:51:12,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:12,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:51:12,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:51:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:51:12,114 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:12,194 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2021-12-14 19:51:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:12,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2021-12-14 19:51:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:12,195 INFO L225 Difference]: With dead ends: 110 [2021-12-14 19:51:12,195 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 19:51:12,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:51:12,195 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 62 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:12,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 311 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 19:51:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2021-12-14 19:51:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2021-12-14 19:51:12,198 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 46 [2021-12-14 19:51:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:12,198 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2021-12-14 19:51:12,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2021-12-14 19:51:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:51:12,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:12,199 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:12,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:12,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:12,409 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash -399124699, now seen corresponding path program 1 times [2021-12-14 19:51:12,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:12,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321727170] [2021-12-14 19:51:12,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:12,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:13,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:13,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321727170] [2021-12-14 19:51:13,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321727170] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:13,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589621180] [2021-12-14 19:51:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:13,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:13,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:13,001 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:13,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 19:51:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:13,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 94 conjunts are in the unsatisfiable core [2021-12-14 19:51:13,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:13,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:13,332 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:13,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:51:13,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:51:13,479 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:13,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-14 19:51:13,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:51:13,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:13,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-14 19:51:13,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-14 19:51:13,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 19:51:13,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 19:51:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:13,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:14,049 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1804) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1804) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-14 19:51:14,057 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1804) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1804) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-14 19:51:14,062 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1804) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1804) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-14 19:51:14,072 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1804) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1804 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1804) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-14 19:51:14,086 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:14,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-14 19:51:14,090 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:14,091 INFO L388 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 64 treesize of output 67 [2021-12-14 19:51:14,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-14 19:51:14,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:14,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-14 19:51:14,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:14,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2021-12-14 19:51:14,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-14 19:51:14,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 Int) (v_ArrVal_1799 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1799) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_1803) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-14 19:51:14,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 Int) (v_ArrVal_1799 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1799) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_1803) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-14 19:51:14,282 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:14,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-14 19:51:14,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2021-12-14 19:51:14,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2021-12-14 19:51:14,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-14 19:51:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 19:51:14,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589621180] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:14,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:14,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 27] total 72 [2021-12-14 19:51:14,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798198842] [2021-12-14 19:51:14,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:14,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2021-12-14 19:51:14,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:14,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-12-14 19:51:14,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4083, Unknown=6, NotChecked=798, Total=5112 [2021-12-14 19:51:14,521 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 72 states, 71 states have (on average 1.676056338028169) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-14 19:51:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:15,976 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2021-12-14 19:51:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 19:51:15,977 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.676056338028169) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2021-12-14 19:51:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:15,978 INFO L225 Difference]: With dead ends: 172 [2021-12-14 19:51:15,978 INFO L226 Difference]: Without dead ends: 172 [2021-12-14 19:51:15,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=551, Invalid=6948, Unknown=7, NotChecked=1050, Total=8556 [2021-12-14 19:51:15,980 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 318 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 2012 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 700 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:15,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 2012 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1215 Invalid, 0 Unknown, 700 Unchecked, 0.4s Time] [2021-12-14 19:51:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-14 19:51:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2021-12-14 19:51:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2021-12-14 19:51:15,983 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 49 [2021-12-14 19:51:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:15,983 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2021-12-14 19:51:15,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.676056338028169) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-14 19:51:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2021-12-14 19:51:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 19:51:15,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:15,983 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:16,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-14 19:51:16,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-14 19:51:16,184 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -656821325, now seen corresponding path program 4 times [2021-12-14 19:51:16,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:16,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949371547] [2021-12-14 19:51:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:16,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:16,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:16,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:16,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-14 19:51:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 19:51:16,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:16,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949371547] [2021-12-14 19:51:16,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949371547] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:16,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632277870] [2021-12-14 19:51:16,292 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 19:51:16,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:16,293 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:16,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 19:51:16,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 19:51:16,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:51:16,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:51:16,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 19:51:16,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:16,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632277870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:16,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:51:16,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-14 19:51:16,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169323788] [2021-12-14 19:51:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:16,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:51:16,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:51:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:16,520 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:51:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:16,528 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-12-14 19:51:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:51:16,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2021-12-14 19:51:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:16,529 INFO L225 Difference]: With dead ends: 87 [2021-12-14 19:51:16,529 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 19:51:16,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:16,529 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:16,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 84 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 19:51:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-14 19:51:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2021-12-14 19:51:16,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 50 [2021-12-14 19:51:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:16,532 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-12-14 19:51:16,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:51:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2021-12-14 19:51:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-14 19:51:16,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:16,533 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:16,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:16,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 19:51:16,744 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash 780049028, now seen corresponding path program 1 times [2021-12-14 19:51:16,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:16,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428452257] [2021-12-14 19:51:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:16,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:16,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 19:51:16,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428452257] [2021-12-14 19:51:16,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428452257] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84696673] [2021-12-14 19:51:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:16,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:16,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:16,851 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:16,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 19:51:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:17,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:51:17,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 19:51:17,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 19:51:17,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84696673] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:17,185 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:17,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2021-12-14 19:51:17,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141587733] [2021-12-14 19:51:17,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:17,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:51:17,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:17,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:51:17,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:51:17,187 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:17,247 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2021-12-14 19:51:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:51:17,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2021-12-14 19:51:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:17,248 INFO L225 Difference]: With dead ends: 84 [2021-12-14 19:51:17,248 INFO L226 Difference]: Without dead ends: 84 [2021-12-14 19:51:17,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:51:17,249 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 115 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:17,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 209 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-14 19:51:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-14 19:51:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-12-14 19:51:17,251 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 55 [2021-12-14 19:51:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:17,251 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-12-14 19:51:17,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-12-14 19:51:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-14 19:51:17,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:17,252 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:17,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:17,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-14 19:51:17,453 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash 780048973, now seen corresponding path program 1 times [2021-12-14 19:51:17,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:17,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539250029] [2021-12-14 19:51:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:17,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:51:17,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539250029] [2021-12-14 19:51:17,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539250029] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:17,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066748861] [2021-12-14 19:51:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:17,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:17,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:17,823 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:17,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 19:51:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:17,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-14 19:51:17,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:17,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:18,057 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:18,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:51:18,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:51:18,101 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:18,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-14 19:51:18,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:18,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-14 19:51:18,327 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:18,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:51:18,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:51:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:51:18,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:18,472 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-14 19:51:18,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 19:51:18,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2250 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-14 19:51:18,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2250 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-14 19:51:18,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2021-12-14 19:51:18,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2250 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-14 19:51:18,497 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2249)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) is different from false [2021-12-14 19:51:18,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) is different from false [2021-12-14 19:51:18,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_2250) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse1))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2021-12-14 19:51:18,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_2250) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse1))))) is different from false [2021-12-14 19:51:18,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2247))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) .cse0 v_ArrVal_2250) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-14 19:51:18,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2247))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_2250) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2021-12-14 19:51:18,564 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:18,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 59 [2021-12-14 19:51:18,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 86 [2021-12-14 19:51:18,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:18,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-14 19:51:18,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:18,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-14 19:51:18,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2021-12-14 19:51:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2021-12-14 19:51:18,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066748861] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:18,876 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:51:18,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 52 [2021-12-14 19:51:18,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223366979] [2021-12-14 19:51:18,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:18,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-14 19:51:18,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:18,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-14 19:51:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1703, Unknown=10, NotChecked=910, Total=2756 [2021-12-14 19:51:18,878 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 46 states have internal predecessors, (115), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:51:19,031 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2247))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_2250) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-14 19:51:19,033 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2247))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3) .cse1 v_ArrVal_2250) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)))) is different from false [2021-12-14 19:51:19,034 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_2250) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse2))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)))) is different from false [2021-12-14 19:51:19,036 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) .cse2 v_ArrVal_2250) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse2))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2021-12-14 19:51:19,038 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| Int) (v_ArrVal_2249 Int) (v_ArrVal_2250 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_26| 4) v_ArrVal_2249))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2 v_ArrVal_2250) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-14 19:51:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:19,522 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-12-14 19:51:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 19:51:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 46 states have internal predecessors, (115), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2021-12-14 19:51:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:19,523 INFO L225 Difference]: With dead ends: 136 [2021-12-14 19:51:19,523 INFO L226 Difference]: Without dead ends: 136 [2021-12-14 19:51:19,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 79 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=2467, Unknown=15, NotChecked=1710, Total=4422 [2021-12-14 19:51:19,524 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 414 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 902 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:19,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 1238 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 921 Invalid, 0 Unknown, 902 Unchecked, 0.3s Time] [2021-12-14 19:51:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-14 19:51:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 83. [2021-12-14 19:51:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 79 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2021-12-14 19:51:19,526 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 55 [2021-12-14 19:51:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:19,526 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2021-12-14 19:51:19,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.2115384615384617) internal successors, (115), 46 states have internal predecessors, (115), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:51:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2021-12-14 19:51:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-14 19:51:19,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:19,526 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:19,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:19,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 19:51:19,727 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash 780048974, now seen corresponding path program 1 times [2021-12-14 19:51:19,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:51:19,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919242369] [2021-12-14 19:51:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:19,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:51:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:51:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:20,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 19:51:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:51:20,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:51:20,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919242369] [2021-12-14 19:51:20,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919242369] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:20,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124203692] [2021-12-14 19:51:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:20,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:20,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:20,264 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:51:20,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 19:51:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:20,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 102 conjunts are in the unsatisfiable core [2021-12-14 19:51:20,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:20,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:20,731 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:20,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:51:20,750 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 415799 column 46: unknown constant v_old(#length)_AFTER_CALL_29 [2021-12-14 19:51:20,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:51:20,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-14 19:51:20,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630798708] [2021-12-14 19:51:20,750 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:20,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 19:51:20,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:51:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 19:51:20,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2021-12-14 19:51:20,751 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 23 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:51:20,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2021-12-14 19:51:20,751 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:20,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:20,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:20,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:51:20,960 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@349de7f8 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 19:51:20,961 INFO L158 Benchmark]: Toolchain (without parser) took 32060.13ms. Allocated memory was 113.2MB in the beginning and 224.4MB in the end (delta: 111.1MB). Free memory was 84.3MB in the beginning and 137.5MB in the end (delta: -53.1MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2021-12-14 19:51:20,962 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:51:20,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.97ms. Allocated memory is still 113.2MB. Free memory was 84.1MB in the beginning and 79.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:51:20,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.27ms. Allocated memory is still 113.2MB. Free memory was 79.9MB in the beginning and 77.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:51:20,962 INFO L158 Benchmark]: Boogie Preprocessor took 31.87ms. Allocated memory is still 113.2MB. Free memory was 77.6MB in the beginning and 76.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:51:20,962 INFO L158 Benchmark]: RCFGBuilder took 304.64ms. Allocated memory is still 113.2MB. Free memory was 75.8MB in the beginning and 60.2MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 19:51:20,962 INFO L158 Benchmark]: TraceAbstraction took 31370.21ms. Allocated memory was 113.2MB in the beginning and 224.4MB in the end (delta: 111.1MB). Free memory was 59.8MB in the beginning and 137.5MB in the end (delta: -77.7MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2021-12-14 19:51:20,963 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory was 70.6MB in the beginning and 70.5MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.97ms. Allocated memory is still 113.2MB. Free memory was 84.1MB in the beginning and 79.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.27ms. Allocated memory is still 113.2MB. Free memory was 79.9MB in the beginning and 77.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.87ms. Allocated memory is still 113.2MB. Free memory was 77.6MB in the beginning and 76.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.64ms. Allocated memory is still 113.2MB. Free memory was 75.8MB in the beginning and 60.2MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31370.21ms. Allocated memory was 113.2MB in the beginning and 224.4MB in the end (delta: 111.1MB). Free memory was 59.8MB in the beginning and 137.5MB in the end (delta: -77.7MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@349de7f8 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@349de7f8: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-14 19:51:20,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:51:22,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:51:22,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:51:22,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:51:22,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:51:22,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:51:22,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:51:22,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:51:22,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:51:22,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:51:22,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:51:22,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:51:22,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:51:22,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:51:22,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:51:22,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:51:22,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:51:22,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:51:22,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:51:22,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:51:22,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:51:22,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:51:22,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:51:22,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:51:22,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:51:22,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:51:22,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:51:22,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:51:22,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:51:22,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:51:22,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:51:22,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:51:22,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:51:22,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:51:22,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:51:22,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:51:22,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:51:22,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:51:22,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:51:22,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:51:22,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:51:22,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:51:22,860 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:51:22,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:51:22,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:51:22,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:51:22,861 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:51:22,861 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:51:22,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:51:22,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:51:22,862 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:51:22,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:51:22,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:51:22,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:51:22,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:51:22,864 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:51:22,864 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:51:22,864 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:51:22,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:51:22,864 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2021-12-14 19:51:23,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:51:23,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:51:23,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:51:23,151 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:51:23,151 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:51:23,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-14 19:51:23,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acaacd0c5/715dddefbc3b4c79be52bc5b7d52eb8c/FLAG57c0ccfbf [2021-12-14 19:51:23,600 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:51:23,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-14 19:51:23,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acaacd0c5/715dddefbc3b4c79be52bc5b7d52eb8c/FLAG57c0ccfbf [2021-12-14 19:51:23,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acaacd0c5/715dddefbc3b4c79be52bc5b7d52eb8c [2021-12-14 19:51:23,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:51:23,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:51:23,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:51:23,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:51:23,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:51:23,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:51:23" (1/1) ... [2021-12-14 19:51:23,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be6acfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:23, skipping insertion in model container [2021-12-14 19:51:23,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:51:23" (1/1) ... [2021-12-14 19:51:23,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:51:24,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:51:24,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-14 19:51:24,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:51:24,288 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:51:24,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2021-12-14 19:51:24,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:51:24,354 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:51:24,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24 WrapperNode [2021-12-14 19:51:24,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:51:24,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:51:24,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:51:24,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:51:24,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,408 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-14 19:51:24,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:51:24,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:51:24,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:51:24,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:51:24,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:51:24,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:51:24,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:51:24,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:51:24,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (1/1) ... [2021-12-14 19:51:24,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:51:24,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:51:24,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:51:24,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:51:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:51:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-14 19:51:24,506 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-14 19:51:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:51:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:51:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:51:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:51:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:51:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:51:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:51:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:51:24,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:51:24,590 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:51:24,591 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:51:24,829 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:51:24,834 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:51:24,834 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 19:51:24,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:51:24 BoogieIcfgContainer [2021-12-14 19:51:24,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:51:24,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:51:24,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:51:24,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:51:24,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:51:23" (1/3) ... [2021-12-14 19:51:24,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f3e062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:51:24, skipping insertion in model container [2021-12-14 19:51:24,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:51:24" (2/3) ... [2021-12-14 19:51:24,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f3e062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:51:24, skipping insertion in model container [2021-12-14 19:51:24,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:51:24" (3/3) ... [2021-12-14 19:51:24,841 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-14 19:51:24,844 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:51:24,844 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-14 19:51:24,870 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:51:24,875 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:51:24,875 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-14 19:51:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:51:24,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:24,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:51:24,889 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-14 19:51:24,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:24,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415923199] [2021-12-14 19:51:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:24,900 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:24,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:24,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:24,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 19:51:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:25,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:51:25,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:25,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:25,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:25,118 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:25,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415923199] [2021-12-14 19:51:25,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415923199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:25,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:25,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:51:25,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766244861] [2021-12-14 19:51:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:25,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:25,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:25,150 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:25,252 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-14 19:51:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:51:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:25,262 INFO L225 Difference]: With dead ends: 81 [2021-12-14 19:51:25,262 INFO L226 Difference]: Without dead ends: 78 [2021-12-14 19:51:25,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:25,265 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:25,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-14 19:51:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-14 19:51:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-14 19:51:25,297 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-14 19:51:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:25,297 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-14 19:51:25,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-14 19:51:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:51:25,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:25,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:51:25,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:25,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:25,505 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-14 19:51:25,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:25,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720216230] [2021-12-14 19:51:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:25,508 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:25,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:25,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:25,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 19:51:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:25,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:51:25,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:25,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:25,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:25,576 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:25,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720216230] [2021-12-14 19:51:25,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720216230] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:25,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:25,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:51:25,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002734076] [2021-12-14 19:51:25,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:25,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:25,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:25,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:25,579 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:25,646 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-14 19:51:25,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:25,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:51:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:25,648 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:51:25,648 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:51:25,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:25,649 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:25,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:51:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:51:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-14 19:51:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-14 19:51:25,654 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-14 19:51:25,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:25,655 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-14 19:51:25,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:51:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-14 19:51:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:51:25,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:25,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:25,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:25,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:25,862 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-14 19:51:25,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:25,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932924386] [2021-12-14 19:51:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:25,864 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:25,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:25,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 19:51:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:25,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:51:25,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:25,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:25,976 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:25,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932924386] [2021-12-14 19:51:25,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932924386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:25,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:25,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:51:25,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434473748] [2021-12-14 19:51:25,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:25,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:51:25,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:25,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:51:25,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:25,978 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:51:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:25,985 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-14 19:51:25,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:51:25,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-14 19:51:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:25,987 INFO L225 Difference]: With dead ends: 83 [2021-12-14 19:51:25,987 INFO L226 Difference]: Without dead ends: 83 [2021-12-14 19:51:25,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:51:25,988 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:25,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-14 19:51:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-14 19:51:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-14 19:51:26,006 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-14 19:51:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:26,007 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-14 19:51:26,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:51:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-14 19:51:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:51:26,007 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:26,008 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:26,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:26,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:26,217 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-14 19:51:26,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:26,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655483547] [2021-12-14 19:51:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:26,218 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:26,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:26,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 19:51:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:26,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:51:26,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:26,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:26,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:26,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:26,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655483547] [2021-12-14 19:51:26,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655483547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:26,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:26,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:51:26,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706351617] [2021-12-14 19:51:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:26,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:26,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:26,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:26,409 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:26,589 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-14 19:51:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:26,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-14 19:51:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:26,592 INFO L225 Difference]: With dead ends: 97 [2021-12-14 19:51:26,592 INFO L226 Difference]: Without dead ends: 97 [2021-12-14 19:51:26,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:51:26,592 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:26,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:51:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-14 19:51:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-14 19:51:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-14 19:51:26,597 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-14 19:51:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:26,597 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-14 19:51:26,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-14 19:51:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:51:26,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:26,598 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:26,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-14 19:51:26,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:26,800 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-14 19:51:26,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:26,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600860917] [2021-12-14 19:51:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:26,803 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:26,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:26,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:26,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 19:51:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:26,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:51:26,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:26,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:27,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:27,002 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:27,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600860917] [2021-12-14 19:51:27,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600860917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:27,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:27,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:51:27,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902008132] [2021-12-14 19:51:27,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:27,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:27,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:27,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:27,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:27,004 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:27,190 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-14 19:51:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-14 19:51:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:27,192 INFO L225 Difference]: With dead ends: 76 [2021-12-14 19:51:27,192 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 19:51:27,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:51:27,193 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:27,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:51:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 19:51:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-14 19:51:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-14 19:51:27,197 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-14 19:51:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:27,197 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-14 19:51:27,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-14 19:51:27,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:51:27,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:27,198 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:27,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:27,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:27,405 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:27,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-14 19:51:27,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:27,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219076623] [2021-12-14 19:51:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:27,406 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:27,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:27,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:27,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 19:51:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:27,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 19:51:27,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:27,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:27,692 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:51:27,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-12-14 19:51:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:27,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:27,898 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:27,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219076623] [2021-12-14 19:51:27,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219076623] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:27,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:51:27,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-12-14 19:51:27,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521184545] [2021-12-14 19:51:27,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:27,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:51:27,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:51:27,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:51:27,900 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:51:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:28,077 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-12-14 19:51:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:51:28,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-14 19:51:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:28,079 INFO L225 Difference]: With dead ends: 101 [2021-12-14 19:51:28,079 INFO L226 Difference]: Without dead ends: 101 [2021-12-14 19:51:28,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:51:28,079 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:28,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 314 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2021-12-14 19:51:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-14 19:51:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2021-12-14 19:51:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-14 19:51:28,084 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2021-12-14 19:51:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:28,084 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-14 19:51:28,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:51:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-14 19:51:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:51:28,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:28,085 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:28,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:28,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:28,292 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-14 19:51:28,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:28,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548802139] [2021-12-14 19:51:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:28,293 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:28,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:28,294 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:28,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 19:51:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:28,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 19:51:28,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:28,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:28,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:28,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:28,615 INFO L388 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-14 19:51:28,623 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:28,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-14 19:51:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:28,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:28,851 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:28,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548802139] [2021-12-14 19:51:28,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548802139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:28,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1213191296] [2021-12-14 19:51:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:28,852 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:51:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:51:28,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:51:28,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-14 19:51:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:28,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 19:51:28,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:28,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:29,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:31,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:31,202 INFO L388 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-14 19:51:31,217 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:31,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-14 19:51:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:51:31,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:31,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1213191296] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:31,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:51:31,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-14 19:51:31,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525343302] [2021-12-14 19:51:31,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:31,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:51:31,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:31,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:51:31,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:51:31,378 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:31,649 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2021-12-14 19:51:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:51:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-14 19:51:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:31,651 INFO L225 Difference]: With dead ends: 163 [2021-12-14 19:51:31,651 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 19:51:31,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:51:31,652 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:31,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 331 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-14 19:51:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 19:51:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 87. [2021-12-14 19:51:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.459016393442623) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-14 19:51:31,665 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 25 [2021-12-14 19:51:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:31,665 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-14 19:51:31,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-14 19:51:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:51:31,666 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:31,666 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:31,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:31,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-14 19:51:32,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:32,068 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-14 19:51:32,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773577643] [2021-12-14 19:51:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:32,068 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:32,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:32,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:32,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 19:51:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:32,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 19:51:32,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:32,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:32,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:32,318 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:32,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773577643] [2021-12-14 19:51:32,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773577643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:32,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:32,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:51:32,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530196782] [2021-12-14 19:51:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:32,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:51:32,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:32,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:51:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:51:32,320 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:32,725 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2021-12-14 19:51:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:51:32,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-14 19:51:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:32,727 INFO L225 Difference]: With dead ends: 155 [2021-12-14 19:51:32,727 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 19:51:32,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:51:32,727 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 313 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:32,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 423 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:51:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 19:51:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 90. [2021-12-14 19:51:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.484375) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2021-12-14 19:51:32,732 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 30 [2021-12-14 19:51:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:32,732 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2021-12-14 19:51:32,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2021-12-14 19:51:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:51:32,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:32,733 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:32,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:32,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:32,940 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:32,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2021-12-14 19:51:32,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:32,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35935707] [2021-12-14 19:51:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:32,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:32,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:32,942 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:32,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 19:51:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:33,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 19:51:33,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:33,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:33,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:33,224 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:33,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35935707] [2021-12-14 19:51:33,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35935707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:33,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:33,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:51:33,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782802890] [2021-12-14 19:51:33,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:33,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:51:33,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:33,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:51:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:51:33,225 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:33,622 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2021-12-14 19:51:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:51:33,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-14 19:51:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:33,623 INFO L225 Difference]: With dead ends: 136 [2021-12-14 19:51:33,623 INFO L226 Difference]: Without dead ends: 136 [2021-12-14 19:51:33,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:51:33,624 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 325 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:33,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 422 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:51:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-14 19:51:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2021-12-14 19:51:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.453125) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2021-12-14 19:51:33,627 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 30 [2021-12-14 19:51:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:33,627 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2021-12-14 19:51:33,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2021-12-14 19:51:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:51:33,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:33,628 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:33,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:33,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:33,829 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2021-12-14 19:51:33,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:33,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097062951] [2021-12-14 19:51:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:33,830 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:33,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:33,830 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:33,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 19:51:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:33,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:51:33,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:33,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:33,965 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:33,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097062951] [2021-12-14 19:51:33,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097062951] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:33,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:33,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:51:33,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740457808] [2021-12-14 19:51:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:33,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:51:33,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:33,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:51:33,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:51:33,966 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:33,986 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2021-12-14 19:51:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:51:33,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-14 19:51:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:33,988 INFO L225 Difference]: With dead ends: 119 [2021-12-14 19:51:33,988 INFO L226 Difference]: Without dead ends: 119 [2021-12-14 19:51:33,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:51:33,988 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:33,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 143 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-14 19:51:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2021-12-14 19:51:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-12-14 19:51:33,992 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 32 [2021-12-14 19:51:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:33,992 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-12-14 19:51:33,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-12-14 19:51:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:51:33,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:33,993 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:34,015 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-14 19:51:34,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:34,218 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-14 19:51:34,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:34,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558616582] [2021-12-14 19:51:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:34,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:34,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:34,221 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:51:34,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 19:51:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:34,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:51:34,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:34,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:51:34,429 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:34,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558616582] [2021-12-14 19:51:34,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558616582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:51:34,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:51:34,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:51:34,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238123045] [2021-12-14 19:51:34,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:51:34,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:51:34,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:34,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:51:34,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:51:34,431 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:34,459 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2021-12-14 19:51:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:51:34,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-14 19:51:34,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:34,460 INFO L225 Difference]: With dead ends: 168 [2021-12-14 19:51:34,460 INFO L226 Difference]: Without dead ends: 168 [2021-12-14 19:51:34,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:51:34,461 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 98 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:34,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 221 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-14 19:51:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 93. [2021-12-14 19:51:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:51:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-12-14 19:51:34,466 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 33 [2021-12-14 19:51:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:34,466 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-12-14 19:51:34,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:51:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-12-14 19:51:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:51:34,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:34,467 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:34,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:34,671 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-14 19:51:34,672 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2021-12-14 19:51:34,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:34,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405050553] [2021-12-14 19:51:34,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:51:34,673 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:34,685 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-14 19:51:34,687 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-14 19:51:34,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:51:34,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:51:34,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:51:34,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:51:34,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 19:51:34,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:34,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405050553] [2021-12-14 19:51:34,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405050553] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:34,983 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:51:34,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-14 19:51:34,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115625029] [2021-12-14 19:51:34,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:34,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:51:34,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:51:34,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:34,984 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 19:51:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:34,995 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2021-12-14 19:51:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:51:34,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2021-12-14 19:51:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:34,996 INFO L225 Difference]: With dead ends: 86 [2021-12-14 19:51:34,996 INFO L226 Difference]: Without dead ends: 86 [2021-12-14 19:51:34,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:51:34,997 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 186 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:34,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 158 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-14 19:51:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-14 19:51:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-14 19:51:34,999 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 37 [2021-12-14 19:51:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:35,000 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-14 19:51:35,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 19:51:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-14 19:51:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:51:35,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:35,001 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:35,008 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-14 19:51:35,208 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-14 19:51:35,208 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash 274321506, now seen corresponding path program 1 times [2021-12-14 19:51:35,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:35,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401293611] [2021-12-14 19:51:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:35,209 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:35,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:35,210 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-14 19:51:35,212 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-14 19:51:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:35,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:51:35,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:35,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:51:35,464 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:35,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401293611] [2021-12-14 19:51:35,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401293611] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:51:35,464 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:51:35,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-14 19:51:35,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311885732] [2021-12-14 19:51:35,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:35,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:51:35,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:51:35,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:51:35,465 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:51:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:35,508 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2021-12-14 19:51:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:51:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2021-12-14 19:51:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:35,510 INFO L225 Difference]: With dead ends: 132 [2021-12-14 19:51:35,510 INFO L226 Difference]: Without dead ends: 132 [2021-12-14 19:51:35,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:51:35,510 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 170 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:35,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 268 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:51:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-14 19:51:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2021-12-14 19:51:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 94 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-12-14 19:51:35,512 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 37 [2021-12-14 19:51:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:35,513 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-12-14 19:51:35,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:51:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-12-14 19:51:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:51:35,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:35,513 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:35,537 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-14 19:51:35,714 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-14 19:51:35,714 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2021-12-14 19:51:35,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:35,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218665500] [2021-12-14 19:51:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:35,715 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:35,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:35,715 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-14 19:51:35,717 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-14 19:51:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:35,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-14 19:51:35,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:35,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:36,019 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:36,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-14 19:51:36,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:51:36,152 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:36,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-14 19:51:36,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:36,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-12-14 19:51:36,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 19:51:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:36,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:36,748 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-14 19:51:36,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-12-14 19:51:36,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-14 19:51:36,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-14 19:51:36,788 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:36,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:51:36,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-14 19:51:36,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 19:51:36,976 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218665500] [2021-12-14 19:51:36,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218665500] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [494666449] [2021-12-14 19:51:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:36,977 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:51:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:51:36,991 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:51:37,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2021-12-14 19:51:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:37,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-14 19:51:37,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:37,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:37,502 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:51:37,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2021-12-14 19:51:37,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:51:37,734 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:37,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-14 19:51:37,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:37,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2021-12-14 19:51:38,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-14 19:51:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:38,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:41,628 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (_ bv1 1)))) is different from false [2021-12-14 19:51:41,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))))))) is different from false [2021-12-14 19:51:41,646 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:41,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-14 19:51:41,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2021-12-14 19:51:41,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-14 19:51:52,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [494666449] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:52,275 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:51:52,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2021-12-14 19:51:52,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403941661] [2021-12-14 19:51:52,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:51:52,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 19:51:52,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:51:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 19:51:52,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1748, Unknown=8, NotChecked=348, Total=2256 [2021-12-14 19:51:52,277 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:51:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:51:53,958 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2021-12-14 19:51:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:51:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2021-12-14 19:51:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:51:53,960 INFO L225 Difference]: With dead ends: 211 [2021-12-14 19:51:53,960 INFO L226 Difference]: Without dead ends: 211 [2021-12-14 19:51:53,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=301, Invalid=2359, Unknown=8, NotChecked=412, Total=3080 [2021-12-14 19:51:53,961 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 512 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:51:53,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 1142 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 588 Invalid, 0 Unknown, 151 Unchecked, 0.8s Time] [2021-12-14 19:51:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-14 19:51:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 109. [2021-12-14 19:51:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 104 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:51:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-12-14 19:51:53,964 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 38 [2021-12-14 19:51:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:51:53,964 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-12-14 19:51:53,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:51:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-12-14 19:51:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:51:53,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:51:53,965 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:51:53,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:54,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-14 19:51:54,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:51:54,365 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:51:54,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:51:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2021-12-14 19:51:54,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:51:54,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411003442] [2021-12-14 19:51:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:54,366 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:51:54,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:51:54,367 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-14 19:51:54,368 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-14 19:51:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:54,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-14 19:51:54,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:54,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:54,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:54,844 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:54,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-14 19:51:54,852 INFO L388 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-14 19:51:54,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:51:54,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:51:55,089 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:55,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:51:55,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:51:55,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:51:55,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:55,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:51:55,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:51:55,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:51:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:55,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:51:56,995 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-14 19:51:57,036 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-14 19:51:57,049 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:57,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-14 19:51:57,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-12-14 19:51:57,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 19:51:57,076 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:57,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-14 19:51:57,089 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:51:57,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-14 19:51:57,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:57,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-14 19:51:57,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:51:57,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 19:51:57,618 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:51:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411003442] [2021-12-14 19:51:57,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411003442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:51:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2143060194] [2021-12-14 19:51:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:51:57,619 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:51:57,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:51:57,620 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:51:57,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-12-14 19:51:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:51:57,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-14 19:51:57,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:51:57,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:57,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:51:58,020 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:51:58,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 19:51:58,040 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:51:58,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 19:51:58,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:51:58,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:51:58,157 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:51:58,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:51:58,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:51:58,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:58,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:51:58,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:51:58,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:51:58,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:51:58,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:51:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:51:58,316 INFO L328 TraceCheckSpWp]: Computing backward predicates...