./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_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/dll2c_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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:49:04,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:49:04,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:49:04,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:49:04,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:49:04,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:49:04,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:49:04,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:49:04,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:49:04,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:49:04,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:49:04,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:49:04,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:49:04,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:49:04,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:49:04,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:49:04,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:49:04,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:49:04,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:49:04,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:49:04,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:49:04,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:49:04,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:49:04,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:49:04,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:49:04,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:49:04,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:49:04,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:49:04,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:49:04,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:49:04,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:49:04,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:49:04,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:49:04,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:49:04,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:49:04,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:49:04,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:49:04,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:49:04,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:49:04,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:49:04,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:49:04,620 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:49:04,650 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:49:04,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:49:04,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:49:04,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:49:04,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:49:04,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:49:04,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:49:04,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:49:04,654 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:49:04,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:49:04,655 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:49:04,655 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:49:04,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:49:04,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:49:04,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:49:04,656 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:49:04,656 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:49:04,656 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:49:04,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:49:04,657 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:49:04,657 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:49:04,657 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:49:04,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:49:04,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:49:04,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:49:04,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:49:04,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:49:04,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:49:04,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:49:04,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:49:04,659 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:49:04,660 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2021-12-14 19:49:04,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:49:04,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:49:04,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:49:04,937 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:49:04,937 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:49:04,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-14 19:49:05,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0097563d1/9df3029500534256b7a6a3bb76e2f1c8/FLAG204768fdf [2021-12-14 19:49:05,536 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:49:05,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-14 19:49:05,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0097563d1/9df3029500534256b7a6a3bb76e2f1c8/FLAG204768fdf [2021-12-14 19:49:05,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0097563d1/9df3029500534256b7a6a3bb76e2f1c8 [2021-12-14 19:49:05,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:49:05,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:49:05,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:49:05,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:49:05,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:49:05,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:49:05" (1/1) ... [2021-12-14 19:49:05,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2d95bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:05, skipping insertion in model container [2021-12-14 19:49:05,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:49:05" (1/1) ... [2021-12-14 19:49:05,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:49:05,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:49:06,169 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/dll2c_update_all.i[24538,24551] [2021-12-14 19:49:06,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:49:06,182 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:49:06,212 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/dll2c_update_all.i[24538,24551] [2021-12-14 19:49:06,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:49:06,233 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:49:06,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06 WrapperNode [2021-12-14 19:49:06,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:49:06,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:49:06,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:49:06,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:49:06,243 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:49:06" (1/1) ... [2021-12-14 19:49:06,259 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:49:06" (1/1) ... [2021-12-14 19:49:06,291 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2021-12-14 19:49:06,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:49:06,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:49:06,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:49:06,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:49:06,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (1/1) ... [2021-12-14 19:49:06,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (1/1) ... [2021-12-14 19:49:06,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (1/1) ... [2021-12-14 19:49:06,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (1/1) ... [2021-12-14 19:49:06,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (1/1) ... [2021-12-14 19:49:06,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (1/1) ... [2021-12-14 19:49:06,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (1/1) ... [2021-12-14 19:49:06,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:49:06,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:49:06,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:49:06,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:49:06,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (1/1) ... [2021-12-14 19:49:06,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:49:06,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:06,368 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:49:06,374 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:49:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:49:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:49:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-14 19:49:06,405 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-14 19:49:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:49:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:49:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:49:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:49:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:49:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:49:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:49:06,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:49:06,547 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:49:06,556 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:49:06,881 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:49:06,888 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:49:06,889 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 19:49:06,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:49:06 BoogieIcfgContainer [2021-12-14 19:49:06,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:49:06,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:49:06,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:49:06,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:49:06,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:49:05" (1/3) ... [2021-12-14 19:49:06,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b3c94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:49:06, skipping insertion in model container [2021-12-14 19:49:06,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:06" (2/3) ... [2021-12-14 19:49:06,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b3c94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:49:06, skipping insertion in model container [2021-12-14 19:49:06,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:49:06" (3/3) ... [2021-12-14 19:49:06,900 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-12-14 19:49:06,905 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:49:06,906 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-14 19:49:06,957 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:49:06,966 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:49:06,967 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-14 19:49:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 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:49:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:49:07,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:07,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:49:07,001 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2021-12-14 19:49:07,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:07,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298449977] [2021-12-14 19:49:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:07,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:07,197 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:49:07,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298449977] [2021-12-14 19:49:07,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298449977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:07,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:07,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:49:07,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131561177] [2021-12-14 19:49:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:07,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:49:07,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:07,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:49:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:49:07,277 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 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:49:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:07,391 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-14 19:49:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:49:07,394 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:49:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:07,402 INFO L225 Difference]: With dead ends: 90 [2021-12-14 19:49:07,402 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 19:49:07,404 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:49:07,407 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:07,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 19:49:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-14 19:49:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 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:49:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-14 19:49:07,454 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2021-12-14 19:49:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:07,455 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-14 19:49:07,455 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:49:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-14 19:49:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:49:07,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:07,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:49:07,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:49:07,457 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2021-12-14 19:49:07,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:07,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974902802] [2021-12-14 19:49:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:07,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:07,548 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:49:07,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974902802] [2021-12-14 19:49:07,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974902802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:07,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:07,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:49:07,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202281839] [2021-12-14 19:49:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:07,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:49:07,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:49:07,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:49:07,558 INFO L87 Difference]: Start difference. First operand 87 states and 95 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:49:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:07,640 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-12-14 19:49:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:49:07,640 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:49:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:07,641 INFO L225 Difference]: With dead ends: 84 [2021-12-14 19:49:07,641 INFO L226 Difference]: Without dead ends: 84 [2021-12-14 19:49:07,642 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:49:07,643 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:07,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:07,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-14 19:49:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-14 19:49:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 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:49:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-14 19:49:07,651 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2021-12-14 19:49:07,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:07,651 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-14 19:49:07,651 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:49:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-14 19:49:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:49:07,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:07,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:07,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:49:07,653 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2021-12-14 19:49:07,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:07,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067131255] [2021-12-14 19:49:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:07,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:07,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:07,762 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:49:07,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:07,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067131255] [2021-12-14 19:49:07,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067131255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:07,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:07,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:49:07,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075881289] [2021-12-14 19:49:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:07,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:49:07,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:49:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:49:07,765 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:49:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:07,837 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-14 19:49:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:49:07,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2021-12-14 19:49:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:07,839 INFO L225 Difference]: With dead ends: 95 [2021-12-14 19:49:07,839 INFO L226 Difference]: Without dead ends: 95 [2021-12-14 19:49:07,840 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:49:07,843 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:07,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-14 19:49:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-14 19:49:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-12-14 19:49:07,851 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2021-12-14 19:49:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:07,852 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-12-14 19:49:07,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:49:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-12-14 19:49:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:49:07,853 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:07,853 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:07,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:49:07,854 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2021-12-14 19:49:07,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:07,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31095874] [2021-12-14 19:49:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:07,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:07,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:07,974 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:49:07,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:07,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31095874] [2021-12-14 19:49:07,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31095874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:07,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:07,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:49:07,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24737925] [2021-12-14 19:49:07,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:07,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:49:07,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:07,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:49:07,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:49:07,979 INFO L87 Difference]: Start difference. First operand 85 states and 93 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:49:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:08,130 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-14 19:49:08,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:08,131 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 24 [2021-12-14 19:49:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:08,133 INFO L225 Difference]: With dead ends: 105 [2021-12-14 19:49:08,133 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 19:49:08,134 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:49:08,135 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:08,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 19:49:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-12-14 19:49:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 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:49:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-14 19:49:08,141 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2021-12-14 19:49:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:08,142 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-14 19:49:08,142 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:49:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-14 19:49:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:49:08,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:08,143 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:08,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:49:08,143 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2021-12-14 19:49:08,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:08,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750851306] [2021-12-14 19:49:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:08,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:08,267 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:49:08,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:08,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750851306] [2021-12-14 19:49:08,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750851306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:08,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:08,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:49:08,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448805961] [2021-12-14 19:49:08,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:08,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:49:08,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:49:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:49:08,273 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:49:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:08,436 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-14 19:49:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2021-12-14 19:49:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:08,439 INFO L225 Difference]: With dead ends: 84 [2021-12-14 19:49:08,439 INFO L226 Difference]: Without dead ends: 84 [2021-12-14 19:49:08,440 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:49:08,440 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:08,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-14 19:49:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-14 19:49:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 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:49:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-14 19:49:08,452 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2021-12-14 19:49:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:08,452 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-14 19:49:08,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:49:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-14 19:49:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:49:08,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:08,453 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:08,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:49:08,454 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2021-12-14 19:49:08,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:08,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101719872] [2021-12-14 19:49:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:08,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:08,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:08,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101719872] [2021-12-14 19:49:08,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101719872] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:08,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012467182] [2021-12-14 19:49:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:08,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:08,630 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:49:08,631 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:49:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:08,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:49:08,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:08,792 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:49:09,041 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:49:09,042 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:49:09,065 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:49:09,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:09,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012467182] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:09,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:49:09,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-14 19:49:09,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66929827] [2021-12-14 19:49:09,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:09,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:09,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:09,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:09,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:49:09,131 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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:49:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:09,334 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2021-12-14 19:49:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:09,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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 26 [2021-12-14 19:49:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:09,345 INFO L225 Difference]: With dead ends: 110 [2021-12-14 19:49:09,345 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 19:49:09,346 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:49:09,346 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:09,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 420 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2021-12-14 19:49:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 19:49:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2021-12-14 19:49:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 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:49:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-14 19:49:09,351 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2021-12-14 19:49:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:09,352 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-14 19:49:09,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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:49:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-14 19:49:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:49:09,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:09,353 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:09,379 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:49:09,567 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:49:09,568 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2021-12-14 19:49:09,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:09,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113053901] [2021-12-14 19:49:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:09,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,808 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:49:09,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:09,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113053901] [2021-12-14 19:49:09,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113053901] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:09,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10555527] [2021-12-14 19:49:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:09,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:09,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:09,811 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:49:09,838 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:49:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 19:49:09,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:09,948 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:49:10,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:10,257 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:49:10,270 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:10,271 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:49:10,312 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:49:10,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:10,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10555527] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:10,433 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:49:10,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-14 19:49:10,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414999311] [2021-12-14 19:49:10,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:10,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:49:10,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:10,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:49:10,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:49:10,435 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 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:49:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:10,750 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2021-12-14 19:49:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:49:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 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 26 [2021-12-14 19:49:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:10,754 INFO L225 Difference]: With dead ends: 90 [2021-12-14 19:49:10,754 INFO L226 Difference]: Without dead ends: 90 [2021-12-14 19:49:10,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-12-14 19:49:10,755 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:10,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 465 Invalid, 0 Unknown, 2 Unchecked, 0.3s Time] [2021-12-14 19:49:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-14 19:49:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2021-12-14 19:49:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 states have internal predecessors, (92), 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:49:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-14 19:49:10,760 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2021-12-14 19:49:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:10,760 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-14 19:49:10,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 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:49:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-14 19:49:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:49:10,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:10,761 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:10,788 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:49:10,971 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:49:10,972 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2021-12-14 19:49:10,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:10,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545176147] [2021-12-14 19:49:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:10,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:11,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:11,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545176147] [2021-12-14 19:49:11,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545176147] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:11,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457077456] [2021-12-14 19:49:11,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:11,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:11,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:11,064 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:49:11,066 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:49:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:49:11,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:11,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:11,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457077456] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:11,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:11,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-14 19:49:11,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587493968] [2021-12-14 19:49:11,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:11,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:49:11,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:11,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:49:11,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:49:11,342 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 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:49:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:11,432 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-14 19:49:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:11,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 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 28 [2021-12-14 19:49:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:11,434 INFO L225 Difference]: With dead ends: 89 [2021-12-14 19:49:11,434 INFO L226 Difference]: Without dead ends: 89 [2021-12-14 19:49:11,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:11,435 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:11,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 436 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-14 19:49:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-12-14 19:49:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 83 states have internal predecessors, (91), 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:49:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-14 19:49:11,441 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2021-12-14 19:49:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:11,442 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-14 19:49:11,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 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:49:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-14 19:49:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:49:11,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:11,443 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:11,468 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:49:11,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:11,660 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2021-12-14 19:49:11,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:11,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363015507] [2021-12-14 19:49:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:11,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,735 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:49:11,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:11,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363015507] [2021-12-14 19:49:11,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363015507] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:11,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131649414] [2021-12-14 19:49:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:11,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:11,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:11,737 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:49:11,759 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:49:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 19:49:11,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:11,907 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:49:11,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:11,923 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:49:11,923 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 12 treesize of output 11 [2021-12-14 19:49:11,965 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:49:11,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131649414] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:11,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:11,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2021-12-14 19:49:11,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808886759] [2021-12-14 19:49:11,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:11,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:49:11,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:11,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:49:11,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:49:11,967 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:49:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:12,089 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2021-12-14 19:49:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:12,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-12-14 19:49:12,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:12,091 INFO L225 Difference]: With dead ends: 113 [2021-12-14 19:49:12,091 INFO L226 Difference]: Without dead ends: 113 [2021-12-14 19:49:12,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:12,091 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:12,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-14 19:49:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2021-12-14 19:49:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 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:49:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2021-12-14 19:49:12,096 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2021-12-14 19:49:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:12,096 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2021-12-14 19:49:12,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:49:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2021-12-14 19:49:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:49:12,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:12,098 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:12,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:12,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:12,311 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2021-12-14 19:49:12,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:12,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046681051] [2021-12-14 19:49:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:12,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:12,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:12,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046681051] [2021-12-14 19:49:12,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046681051] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:12,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053321844] [2021-12-14 19:49:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:12,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:12,467 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:49:12,491 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:49:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:12,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 19:49:12,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:12,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:12,764 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:12,765 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 23 [2021-12-14 19:49:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:12,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053321844] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:12,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:12,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2021-12-14 19:49:12,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488464007] [2021-12-14 19:49:12,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:12,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 19:49:12,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:12,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 19:49:12,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:49:12,919 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-14 19:49:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:13,170 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-14 19:49:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:49:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2021-12-14 19:49:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:13,172 INFO L225 Difference]: With dead ends: 150 [2021-12-14 19:49:13,172 INFO L226 Difference]: Without dead ends: 150 [2021-12-14 19:49:13,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:49:13,173 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:13,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 752 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:49:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-14 19:49:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2021-12-14 19:49:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 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:49:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2021-12-14 19:49:13,177 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2021-12-14 19:49:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:13,177 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2021-12-14 19:49:13,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-14 19:49:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2021-12-14 19:49:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:49:13,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:13,179 INFO L514 BasicCegarLoop]: trace histogram [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:49:13,197 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:49:13,387 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,SelfDestructingSolverStorable9 [2021-12-14 19:49:13,388 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2021-12-14 19:49:13,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:13,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744855080] [2021-12-14 19:49:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:13,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:49:13,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:13,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744855080] [2021-12-14 19:49:13,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744855080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:13,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:13,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:49:13,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820755007] [2021-12-14 19:49:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:13,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:49:13,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:49:13,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:13,476 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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:49:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:13,618 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-12-14 19:49:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:49:13,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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:49:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:13,620 INFO L225 Difference]: With dead ends: 111 [2021-12-14 19:49:13,620 INFO L226 Difference]: Without dead ends: 111 [2021-12-14 19:49:13,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:49:13,620 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 135 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:13,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 294 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-14 19:49:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2021-12-14 19:49:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 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:49:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2021-12-14 19:49:13,625 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2021-12-14 19:49:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:13,625 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2021-12-14 19:49:13,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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:49:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2021-12-14 19:49:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:49:13,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:13,629 INFO L514 BasicCegarLoop]: trace histogram [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:49:13,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:49:13,630 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2021-12-14 19:49:13,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:13,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845124268] [2021-12-14 19:49:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:13,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:13,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:13,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845124268] [2021-12-14 19:49:13,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845124268] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:13,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:13,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:49:13,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698681243] [2021-12-14 19:49:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:13,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:49:13,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:49:13,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:49:13,798 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 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:49:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:13,950 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2021-12-14 19:49:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:49:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 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:49:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:13,951 INFO L225 Difference]: With dead ends: 89 [2021-12-14 19:49:13,951 INFO L226 Difference]: Without dead ends: 89 [2021-12-14 19:49:13,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:13,952 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 142 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:13,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 295 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-14 19:49:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-14 19:49:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 states have internal predecessors, (93), 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:49:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2021-12-14 19:49:13,954 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2021-12-14 19:49:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:13,954 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2021-12-14 19:49:13,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 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:49:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2021-12-14 19:49:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:49:13,955 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:13,955 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:13,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:49:13,956 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2021-12-14 19:49:13,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:13,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984712549] [2021-12-14 19:49:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:13,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:49:14,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:14,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984712549] [2021-12-14 19:49:14,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984712549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:14,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:14,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:49:14,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318058823] [2021-12-14 19:49:14,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:14,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:14,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:14,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:14,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:14,068 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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:49:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:14,344 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-12-14 19:49:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:49:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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 35 [2021-12-14 19:49:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:14,346 INFO L225 Difference]: With dead ends: 158 [2021-12-14 19:49:14,346 INFO L226 Difference]: Without dead ends: 158 [2021-12-14 19:49:14,346 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:49:14,347 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 320 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:14,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 509 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:49:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-14 19:49:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2021-12-14 19:49:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 87 states have internal predecessors, (99), 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:49:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-14 19:49:14,350 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2021-12-14 19:49:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:14,351 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-14 19:49:14,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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:49:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-14 19:49:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:49:14,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:14,352 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:14,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:49:14,352 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2021-12-14 19:49:14,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:14,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548569178] [2021-12-14 19:49:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:14,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:14,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:14,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548569178] [2021-12-14 19:49:14,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548569178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:14,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:14,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:49:14,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219470104] [2021-12-14 19:49:14,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:14,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:14,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:14,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:14,516 INFO L87 Difference]: Start difference. First operand 92 states and 105 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:49:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:14,812 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2021-12-14 19:49:14,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:49:14,812 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 35 [2021-12-14 19:49:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:14,813 INFO L225 Difference]: With dead ends: 138 [2021-12-14 19:49:14,813 INFO L226 Difference]: Without dead ends: 138 [2021-12-14 19:49:14,813 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:49:14,814 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 331 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:14,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 515 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:49:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-14 19:49:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2021-12-14 19:49:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.515625) internal successors, (97), 87 states have internal predecessors, (97), 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:49:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-12-14 19:49:14,817 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 35 [2021-12-14 19:49:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:14,817 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-12-14 19:49:14,817 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:49:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-12-14 19:49:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:49:14,818 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:14,818 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:14,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:49:14,818 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1296521997, now seen corresponding path program 1 times [2021-12-14 19:49:14,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:14,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899832182] [2021-12-14 19:49:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:14,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,885 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:49:14,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899832182] [2021-12-14 19:49:14,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899832182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:14,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:14,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:49:14,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191185503] [2021-12-14 19:49:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:14,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:49:14,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:49:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:49:14,888 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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:49:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:14,946 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2021-12-14 19:49:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:49:14,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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:49:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:14,948 INFO L225 Difference]: With dead ends: 121 [2021-12-14 19:49:14,948 INFO L226 Difference]: Without dead ends: 121 [2021-12-14 19:49:14,948 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:49:14,948 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 89 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:14,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 209 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-14 19:49:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2021-12-14 19:49:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5) internal successors, (99), 89 states have internal predecessors, (99), 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:49:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2021-12-14 19:49:14,952 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 37 [2021-12-14 19:49:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:14,952 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2021-12-14 19:49:14,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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:49:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2021-12-14 19:49:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:49:14,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:14,953 INFO L514 BasicCegarLoop]: trace histogram [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:49:14,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:49:14,954 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2021-12-14 19:49:14,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:14,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766824237] [2021-12-14 19:49:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:14,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:15,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:15,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766824237] [2021-12-14 19:49:15,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766824237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:15,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:15,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:49:15,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192363066] [2021-12-14 19:49:15,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:15,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:49:15,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:15,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:49:15,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:49:15,012 INFO L87 Difference]: Start difference. First operand 94 states and 105 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:49:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:15,072 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2021-12-14 19:49:15,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:49:15,073 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 38 [2021-12-14 19:49:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:15,074 INFO L225 Difference]: With dead ends: 170 [2021-12-14 19:49:15,074 INFO L226 Difference]: Without dead ends: 170 [2021-12-14 19:49:15,075 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:49:15,075 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 98 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:15,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 287 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-14 19:49:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 95. [2021-12-14 19:49:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 90 states have internal predecessors, (100), 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:49:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2021-12-14 19:49:15,079 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 38 [2021-12-14 19:49:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:15,079 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2021-12-14 19:49:15,079 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:49:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2021-12-14 19:49:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:49:15,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:15,086 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:15,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:49:15,086 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2021-12-14 19:49:15,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:15,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13021664] [2021-12-14 19:49:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:15,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-14 19:49:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 19:49:15,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13021664] [2021-12-14 19:49:15,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13021664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340065146] [2021-12-14 19:49:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:15,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:15,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:15,207 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:49:15,234 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:49:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:49:15,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:49:15,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:49:15,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340065146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:15,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:49:15,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-14 19:49:15,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828232492] [2021-12-14 19:49:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:15,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:49:15,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:15,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:49:15,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:49:15,567 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:49:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:15,587 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-12-14 19:49:15,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:49:15,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2021-12-14 19:49:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:15,588 INFO L225 Difference]: With dead ends: 83 [2021-12-14 19:49:15,588 INFO L226 Difference]: Without dead ends: 83 [2021-12-14 19:49:15,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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:49:15,589 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 126 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 95 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:49:15,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:49:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-14 19:49:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-12-14 19:49:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 79 states have internal predecessors, (86), 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:49:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-12-14 19:49:15,597 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 41 [2021-12-14 19:49:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:15,598 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-12-14 19:49:15,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:49:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-12-14 19:49:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:49:15,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:15,599 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:15,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:15,811 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:49:15,811 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116999, now seen corresponding path program 1 times [2021-12-14 19:49:15,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:15,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151844229] [2021-12-14 19:49:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:15,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 19:49:16,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:16,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151844229] [2021-12-14 19:49:16,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151844229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:16,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:16,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:49:16,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111100445] [2021-12-14 19:49:16,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:16,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:16,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:16,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:16,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:16,019 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:16,331 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2021-12-14 19:49:16,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:49:16,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2021-12-14 19:49:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:16,332 INFO L225 Difference]: With dead ends: 108 [2021-12-14 19:49:16,332 INFO L226 Difference]: Without dead ends: 108 [2021-12-14 19:49:16,333 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:49:16,333 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 289 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:16,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 317 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:49:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-14 19:49:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2021-12-14 19:49:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 82 states have internal predecessors, (92), 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:49:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2021-12-14 19:49:16,337 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 42 [2021-12-14 19:49:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:16,337 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2021-12-14 19:49:16,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2021-12-14 19:49:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:49:16,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:16,338 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:16,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:49:16,338 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116998, now seen corresponding path program 1 times [2021-12-14 19:49:16,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:16,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969904919] [2021-12-14 19:49:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:16,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:16,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:16,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969904919] [2021-12-14 19:49:16,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969904919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:16,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848963202] [2021-12-14 19:49:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:16,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:16,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:16,485 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:49:16,511 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:49:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:49:16,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:16,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:16,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848963202] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:16,986 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:16,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-14 19:49:16,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17405707] [2021-12-14 19:49:16,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:16,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:16,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:16,991 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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:49:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:17,104 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2021-12-14 19:49:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:49:17,105 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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 42 [2021-12-14 19:49:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:17,105 INFO L225 Difference]: With dead ends: 108 [2021-12-14 19:49:17,105 INFO L226 Difference]: Without dead ends: 108 [2021-12-14 19:49:17,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:17,106 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 148 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:17,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 293 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-14 19:49:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-12-14 19:49:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.481012658227848) internal successors, (117), 98 states have internal predecessors, (117), 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:49:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2021-12-14 19:49:17,109 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 42 [2021-12-14 19:49:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:17,109 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2021-12-14 19:49:17,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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:49:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2021-12-14 19:49:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:49:17,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:17,110 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:17,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 19:49:17,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:17,319 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:17,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash -960994977, now seen corresponding path program 1 times [2021-12-14 19:49:17,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:17,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112493063] [2021-12-14 19:49:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:17,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:17,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:17,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112493063] [2021-12-14 19:49:17,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112493063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:17,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027014579] [2021-12-14 19:49:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:17,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:17,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:17,954 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:49:17,955 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:49:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:18,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-14 19:49:18,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:18,251 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:49:18,410 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:18,410 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:49:18,502 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:49:18,579 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:18,580 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 35 treesize of output 34 [2021-12-14 19:49:18,672 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:18,673 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:49:18,715 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:49:18,716 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 26 [2021-12-14 19:49:18,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:18,924 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:49:19,020 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:49:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:19,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:22,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2021-12-14 19:49:22,205 INFO L354 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2021-12-14 19:49:22,205 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 22 treesize of output 21 [2021-12-14 19:49:22,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2200) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-14 19:49:22,223 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:22,224 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 21 treesize of output 22 [2021-12-14 19:49:22,229 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 60 treesize of output 52 [2021-12-14 19:49:22,236 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:49:22,242 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 38 treesize of output 34 [2021-12-14 19:49:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:22,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027014579] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:22,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:22,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 48 [2021-12-14 19:49:22,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357940652] [2021-12-14 19:49:22,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:22,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-14 19:49:22,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:22,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-14 19:49:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2024, Unknown=14, NotChecked=182, Total=2352 [2021-12-14 19:49:22,662 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 41 states have internal predecessors, (90), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-14 19:49:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:24,187 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2021-12-14 19:49:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 19:49:24,187 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.875) internal successors, (90), 41 states have internal predecessors, (90), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2021-12-14 19:49:24,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:24,189 INFO L225 Difference]: With dead ends: 220 [2021-12-14 19:49:24,189 INFO L226 Difference]: Without dead ends: 220 [2021-12-14 19:49:24,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=358, Invalid=3296, Unknown=14, NotChecked=238, Total=3906 [2021-12-14 19:49:24,193 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 1015 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:24,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1015 Valid, 1680 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1378 Invalid, 0 Unknown, 488 Unchecked, 0.7s Time] [2021-12-14 19:49:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-14 19:49:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2021-12-14 19:49:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 108 states have internal predecessors, (132), 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:49:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2021-12-14 19:49:24,197 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 43 [2021-12-14 19:49:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:24,197 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2021-12-14 19:49:24,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.875) internal successors, (90), 41 states have internal predecessors, (90), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-14 19:49:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2021-12-14 19:49:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:49:24,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:24,199 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:24,219 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:49:24,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:24,412 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:24,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash -960994976, now seen corresponding path program 1 times [2021-12-14 19:49:24,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:24,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255487063] [2021-12-14 19:49:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:24,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:25,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:25,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255487063] [2021-12-14 19:49:25,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255487063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:25,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361955433] [2021-12-14 19:49:25,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:25,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:25,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:25,016 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:49:25,042 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:49:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-14 19:49:25,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:25,223 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:49:25,580 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:25,580 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:49:25,587 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:49:25,676 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:49:25,680 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:49:25,766 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:25,766 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 45 treesize of output 42 [2021-12-14 19:49:25,770 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:49:25,918 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:25,918 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:49:25,921 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:49:25,987 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:49:25,987 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 26 [2021-12-14 19:49:25,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:25,997 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:49:26,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:26,183 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:49:26,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:26,188 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:49:26,308 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:49:26,312 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 15 treesize of output 7 [2021-12-14 19:49:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:26,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:29,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2402 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2402) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_2401 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2401) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))))) is different from false [2021-12-14 19:49:31,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2402 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_2402) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((v_ArrVal_2401 Int)) (<= 0 (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) is different from false [2021-12-14 19:49:33,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2402 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2402) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2401 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-14 19:49:33,940 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:33,941 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 97 treesize of output 90 [2021-12-14 19:49:33,950 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:33,951 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 90 treesize of output 90 [2021-12-14 19:49:33,958 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 231 treesize of output 227 [2021-12-14 19:49:33,969 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 770 treesize of output 758 [2021-12-14 19:49:33,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:33,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:33,997 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 708 treesize of output 696 [2021-12-14 19:49:34,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,012 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 656 treesize of output 646 [2021-12-14 19:49:34,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,042 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 597 treesize of output 589 [2021-12-14 19:49:34,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,056 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 509 treesize of output 493 [2021-12-14 19:49:34,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,067 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 453 treesize of output 445 [2021-12-14 19:49:34,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,075 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 365 treesize of output 349 [2021-12-14 19:49:34,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,083 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 329 treesize of output 325 [2021-12-14 19:49:34,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:34,147 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 315 treesize of output 313 [2021-12-14 19:49:34,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361955433] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:34,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:49:34,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2021-12-14 19:49:34,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796083213] [2021-12-14 19:49:34,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:34,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-14 19:49:34,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-14 19:49:34,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2814, Unknown=6, NotChecked=324, Total=3306 [2021-12-14 19:49:34,825 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 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:49:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:36,609 INFO L93 Difference]: Finished difference Result 252 states and 309 transitions. [2021-12-14 19:49:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:49:36,609 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 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 43 [2021-12-14 19:49:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:36,610 INFO L225 Difference]: With dead ends: 252 [2021-12-14 19:49:36,611 INFO L226 Difference]: Without dead ends: 252 [2021-12-14 19:49:36,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=351, Invalid=4211, Unknown=6, NotChecked=402, Total=4970 [2021-12-14 19:49:36,613 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 1515 mSDsluCounter, 2153 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:36,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 2244 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1431 Invalid, 0 Unknown, 127 Unchecked, 0.8s Time] [2021-12-14 19:49:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-14 19:49:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 120. [2021-12-14 19:49:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.4742268041237114) internal successors, (143), 116 states have internal predecessors, (143), 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:49:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2021-12-14 19:49:36,621 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 43 [2021-12-14 19:49:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:36,622 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2021-12-14 19:49:36,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 37 states have internal predecessors, (76), 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:49:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2021-12-14 19:49:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:49:36,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:36,623 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:36,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 19:49:36,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:36,847 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1252304435, now seen corresponding path program 2 times [2021-12-14 19:49:36,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:36,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076758210] [2021-12-14 19:49:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:36,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:36,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:36,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:36,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076758210] [2021-12-14 19:49:36,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076758210] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:36,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740629987] [2021-12-14 19:49:36,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:49:36,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:36,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:36,923 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:49:36,960 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:49:37,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:49:37,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:49:37,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:49:37,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:37,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:37,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740629987] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:37,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:37,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-14 19:49:37,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366917103] [2021-12-14 19:49:37,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:37,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:49:37,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:37,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:49:37,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:37,362 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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:49:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:37,454 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2021-12-14 19:49:37,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:49:37,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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 46 [2021-12-14 19:49:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:37,456 INFO L225 Difference]: With dead ends: 112 [2021-12-14 19:49:37,456 INFO L226 Difference]: Without dead ends: 112 [2021-12-14 19:49:37,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:49:37,457 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 239 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:37,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 259 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-14 19:49:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2021-12-14 19:49:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 102 states have internal predecessors, (122), 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:49:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2021-12-14 19:49:37,460 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 46 [2021-12-14 19:49:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:37,461 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2021-12-14 19:49:37,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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:49:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2021-12-14 19:49:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:49:37,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:37,462 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:37,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:37,679 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,SelfDestructingSolverStorable21 [2021-12-14 19:49:37,679 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676750, now seen corresponding path program 2 times [2021-12-14 19:49:37,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:37,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043543036] [2021-12-14 19:49:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:37,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:37,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:37,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:37,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:37,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043543036] [2021-12-14 19:49:37,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043543036] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:37,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59397233] [2021-12-14 19:49:37,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:49:37,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:37,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:37,777 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:49:37,805 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:49:37,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 19:49:37,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:49:37,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:49:38,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-14 19:49:38,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:49:38,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59397233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:38,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:49:38,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2021-12-14 19:49:38,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148044599] [2021-12-14 19:49:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:38,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:38,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:38,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:38,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:49:38,207 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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:49:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:38,401 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2021-12-14 19:49:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:49:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 47 [2021-12-14 19:49:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:38,402 INFO L225 Difference]: With dead ends: 147 [2021-12-14 19:49:38,402 INFO L226 Difference]: Without dead ends: 147 [2021-12-14 19:49:38,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-12-14 19:49:38,403 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 426 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:38,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 276 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-14 19:49:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2021-12-14 19:49:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 102 states have internal predecessors, (120), 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:49:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2021-12-14 19:49:38,406 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 47 [2021-12-14 19:49:38,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:38,407 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2021-12-14 19:49:38,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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:49:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2021-12-14 19:49:38,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:49:38,407 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:38,408 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:38,430 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:49:38,619 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,SelfDestructingSolverStorable22 [2021-12-14 19:49:38,619 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676805, now seen corresponding path program 1 times [2021-12-14 19:49:38,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:38,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884591795] [2021-12-14 19:49:38,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:38,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 19:49:38,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:38,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884591795] [2021-12-14 19:49:38,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884591795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:38,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:38,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:49:38,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903210174] [2021-12-14 19:49:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:38,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:49:38,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:38,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:49:38,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:49:38,683 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:49:38,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:38,747 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-14 19:49:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:49:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 47 [2021-12-14 19:49:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:38,753 INFO L225 Difference]: With dead ends: 103 [2021-12-14 19:49:38,753 INFO L226 Difference]: Without dead ends: 103 [2021-12-14 19:49:38,753 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:49:38,754 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 19 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 262 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.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:38,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 262 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-14 19:49:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-12-14 19:49:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 97 states have internal predecessors, (108), 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:49:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-12-14 19:49:38,758 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 47 [2021-12-14 19:49:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:38,759 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-12-14 19:49:38,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:49:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-12-14 19:49:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:49:38,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:38,760 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 19:49:38,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 19:49:38,760 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:38,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1716069023, now seen corresponding path program 1 times [2021-12-14 19:49:38,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:38,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519882206] [2021-12-14 19:49:38,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:38,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:38,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:38,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519882206] [2021-12-14 19:49:38,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519882206] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:38,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742489648] [2021-12-14 19:49:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:38,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:38,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:38,864 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:49:38,894 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:49:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:39,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:49:39,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:39,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:39,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742489648] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:39,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:39,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-12-14 19:49:39,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785942369] [2021-12-14 19:49:39,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:39,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:49:39,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:39,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:49:39,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:39,254 INFO L87 Difference]: Start difference. First operand 101 states and 112 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:49:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:39,309 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-12-14 19:49:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:49:39,310 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 51 [2021-12-14 19:49:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:39,310 INFO L225 Difference]: With dead ends: 99 [2021-12-14 19:49:39,310 INFO L226 Difference]: Without dead ends: 99 [2021-12-14 19:49:39,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:39,311 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 118 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:39,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 285 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-14 19:49:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-14 19:49:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 93 states have internal predecessors, (101), 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:49:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-14 19:49:39,314 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2021-12-14 19:49:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:39,314 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-14 19:49:39,314 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:49:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-14 19:49:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:49:39,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:39,315 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-12-14 19:49:39,335 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:49:39,527 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,SelfDestructingSolverStorable24 [2021-12-14 19:49:39,527 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash -291844745, now seen corresponding path program 3 times [2021-12-14 19:49:39,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:39,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039249578] [2021-12-14 19:49:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:39,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 19:49:39,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039249578] [2021-12-14 19:49:39,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039249578] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287997443] [2021-12-14 19:49:39,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:49:39,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:39,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:39,636 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:49:39,659 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:49:40,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 19:49:40,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:49:40,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:49:40,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 19:49:40,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:49:40,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287997443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:40,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:49:40,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-12-14 19:49:40,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90554532] [2021-12-14 19:49:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:40,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:49:40,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:49:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:40,418 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:40,442 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2021-12-14 19:49:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:49:40,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2021-12-14 19:49:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:40,443 INFO L225 Difference]: With dead ends: 93 [2021-12-14 19:49:40,443 INFO L226 Difference]: Without dead ends: 93 [2021-12-14 19:49:40,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:40,444 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 137 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 145 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:49:40,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 145 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:49:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-14 19:49:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-14 19:49:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 87 states have internal predecessors, (93), 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:49:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-14 19:49:40,446 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 51 [2021-12-14 19:49:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:40,447 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-14 19:49:40,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-14 19:49:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-14 19:49:40,448 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:40,448 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2021-12-14 19:49:40,478 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:49:40,648 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,SelfDestructingSolverStorable25 [2021-12-14 19:49:40,649 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash 878531443, now seen corresponding path program 1 times [2021-12-14 19:49:40,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:40,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649267790] [2021-12-14 19:49:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:40,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:41,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:41,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:41,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649267790] [2021-12-14 19:49:41,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649267790] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:41,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501102431] [2021-12-14 19:49:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:41,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:41,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:41,392 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:49:41,420 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:49:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:41,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-14 19:49:41,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:41,714 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:49:41,932 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:41,932 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:49:42,045 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:49:42,123 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:42,124 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 26 treesize of output 27 [2021-12-14 19:49:42,245 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:42,245 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:49:42,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:42,299 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:49:42,523 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:49:42,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:42,530 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:49:42,697 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:49:42,815 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:49:43,031 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:49:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:49:43,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:43,324 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3483 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3483 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-14 19:49:43,336 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3483 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3483 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-14 19:49:43,343 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3483 (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_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) (forall ((v_ArrVal_3483 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-14 19:49:43,365 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3483 (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_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3483 (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_3483) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-14 19:49:43,390 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:43,390 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:49:43,399 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:43,400 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:49:43,405 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:49:43,457 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:43,457 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:49:43,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:43,462 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:49:43,467 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:49:43,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3476) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-14 19:49:43,747 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3476) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-14 19:49:43,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3476 (Array Int Int)) (v_ArrVal_3481 Int)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3475) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3476) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-14 19:49:43,764 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:43,765 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 27 treesize of output 28 [2021-12-14 19:49:43,767 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 171 treesize of output 165 [2021-12-14 19:49:43,770 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 191 treesize of output 185 [2021-12-14 19:49:43,780 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:49:43,789 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:49:43,800 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:49:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 19:49:44,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501102431] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:44,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:44,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 75 [2021-12-14 19:49:44,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192089264] [2021-12-14 19:49:44,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:44,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-12-14 19:49:44,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-12-14 19:49:44,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4316, Unknown=7, NotChecked=966, Total=5550 [2021-12-14 19:49:44,298 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 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:49:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:45,649 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-12-14 19:49:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 19:49:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 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 54 [2021-12-14 19:49:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:45,650 INFO L225 Difference]: With dead ends: 91 [2021-12-14 19:49:45,650 INFO L226 Difference]: Without dead ends: 91 [2021-12-14 19:49:45,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=479, Invalid=6348, Unknown=7, NotChecked=1176, Total=8010 [2021-12-14 19:49:45,653 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 229 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 723 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:45,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 1608 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1105 Invalid, 0 Unknown, 723 Unchecked, 0.5s Time] [2021-12-14 19:49:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-14 19:49:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-14 19:49:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 87 states have internal predecessors, (92), 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:49:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-12-14 19:49:45,658 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 54 [2021-12-14 19:49:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:45,658 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-12-14 19:49:45,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 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:49:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-12-14 19:49:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 19:49:45,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:45,659 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, 1, 1] [2021-12-14 19:49:45,681 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:49:45,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:45,872 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:45,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1199894254, now seen corresponding path program 1 times [2021-12-14 19:49:45,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:45,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267812269] [2021-12-14 19:49:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:45,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 19:49:46,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:46,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267812269] [2021-12-14 19:49:46,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267812269] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:46,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663700400] [2021-12-14 19:49:46,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:46,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:46,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:46,058 INFO L229 MonitoredProcess]: Starting monitored process 16 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:49:46,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 19:49:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:46,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-14 19:49:46,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:49:46,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 19:49:47,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663700400] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:47,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:47,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2021-12-14 19:49:47,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194454784] [2021-12-14 19:49:47,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:47,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-14 19:49:47,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-14 19:49:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2021-12-14 19:49:47,119 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 19:49:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:47,461 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-12-14 19:49:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:49:47,461 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2021-12-14 19:49:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:47,462 INFO L225 Difference]: With dead ends: 125 [2021-12-14 19:49:47,462 INFO L226 Difference]: Without dead ends: 125 [2021-12-14 19:49:47,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 19:49:47,463 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 862 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:47,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 456 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:49:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-14 19:49:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2021-12-14 19:49:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 87 states have internal predecessors, (91), 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:49:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-12-14 19:49:47,466 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 57 [2021-12-14 19:49:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:47,467 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-12-14 19:49:47,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 19:49:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-12-14 19:49:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-14 19:49:47,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:47,468 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2021-12-14 19:49:47,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:47,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-14 19:49:47,679 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 963119259, now seen corresponding path program 1 times [2021-12-14 19:49:47,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:47,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904442384] [2021-12-14 19:49:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:47,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:48,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:49:48,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:48,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904442384] [2021-12-14 19:49:48,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904442384] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:48,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973448031] [2021-12-14 19:49:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:48,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:48,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:48,256 INFO L229 MonitoredProcess]: Starting monitored process 17 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:49:48,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 19:49:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:48,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-14 19:49:48,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:48,591 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:49:48,705 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:48,706 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:49:48,765 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:49:48,810 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:48,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2021-12-14 19:49:48,906 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:48,906 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:49:48,952 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:49:48,952 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 26 [2021-12-14 19:49:49,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:49,065 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:49:49,205 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:49,205 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:49:49,293 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:49:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:49:49,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:49,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3878) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-14 19:49:49,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3878) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-14 19:49:49,417 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3878) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-14 19:49:49,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3877))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-14 19:49:49,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3877))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-12-14 19:49:49,556 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3877))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2021-12-14 19:49:49,976 INFO L354 Elim1Store]: treesize reduction 5, result has 91.9 percent of original size [2021-12-14 19:49:49,977 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 66 treesize of output 65 [2021-12-14 19:49:49,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3874 Int) (v_ArrVal_3873 (Array Int Int)) (v_ArrVal_3878 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3872) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3873))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3874) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3877))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3878))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2021-12-14 19:49:50,018 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:50,019 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 81 treesize of output 66 [2021-12-14 19:49:50,023 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 260 treesize of output 252 [2021-12-14 19:49:50,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:50,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:50,031 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 100 treesize of output 92 [2021-12-14 19:49:50,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:50,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:50,040 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 92 treesize of output 86 [2021-12-14 19:49:50,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:50,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:50,044 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 106 treesize of output 94 [2021-12-14 19:49:50,048 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 94 treesize of output 86 [2021-12-14 19:49:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2021-12-14 19:49:50,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973448031] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:50,472 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:50,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 26] total 60 [2021-12-14 19:49:50,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523405550] [2021-12-14 19:49:50,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:50,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-14 19:49:50,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-14 19:49:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2570, Unknown=136, NotChecked=770, Total=3660 [2021-12-14 19:49:50,475 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 61 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 53 states have internal predecessors, (128), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-14 19:49:50,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3877 Int) (v_ArrVal_3878 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3877))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3878)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (not (= 0 .cse3)) (= .cse3 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)))) is different from false [2021-12-14 19:49:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:51,661 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2021-12-14 19:49:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 19:49:51,662 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 53 states have internal predecessors, (128), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2021-12-14 19:49:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:51,663 INFO L225 Difference]: With dead ends: 150 [2021-12-14 19:49:51,663 INFO L226 Difference]: Without dead ends: 150 [2021-12-14 19:49:51,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=3841, Unknown=178, NotChecked=1080, Total=5402 [2021-12-14 19:49:51,664 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 256 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1143 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:51,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 1345 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1153 Invalid, 0 Unknown, 1143 Unchecked, 0.5s Time] [2021-12-14 19:49:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-14 19:49:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 95. [2021-12-14 19:49:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 91 states have internal predecessors, (98), 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:49:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-14 19:49:51,667 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 60 [2021-12-14 19:49:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:51,667 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-14 19:49:51,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 53 states have internal predecessors, (128), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-14 19:49:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-14 19:49:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-14 19:49:51,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:51,668 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2021-12-14 19:49:51,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:51,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-14 19:49:51,891 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash 963119260, now seen corresponding path program 1 times [2021-12-14 19:49:51,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:51,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550382719] [2021-12-14 19:49:51,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:51,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:49:52,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:52,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550382719] [2021-12-14 19:49:52,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550382719] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:52,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054273726] [2021-12-14 19:49:52,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:52,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:52,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:52,715 INFO L229 MonitoredProcess]: Starting monitored process 18 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:49:52,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 19:49:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:53,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-14 19:49:53,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:53,026 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:49:53,335 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:49:53,335 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:49:53,349 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:53,349 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:49:53,464 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:49:53,474 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:49:53,546 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:53,547 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 45 treesize of output 42 [2021-12-14 19:49:53,557 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:49:53,696 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:53,696 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:49:53,699 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:49:53,766 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:49:53,766 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 26 [2021-12-14 19:49:53,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:53,774 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:49:53,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:53,922 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:49:53,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:53,926 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:49:54,152 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:54,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 38 treesize of output 37 [2021-12-14 19:49:54,156 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:49:54,346 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:49:54,350 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 15 treesize of output 7 [2021-12-14 19:49:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 19:49:54,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:54,672 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_4090 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-14 19:49:54,704 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_4090 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2021-12-14 19:49:54,734 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_4090 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2021-12-14 19:49:54,812 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (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|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_4090 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2021-12-14 19:49:54,841 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_4088)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_4086)) .cse1 v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ (select (select (let ((.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse3 v_ArrVal_4086)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse3 v_ArrVal_4088)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2021-12-14 19:49:54,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ 8 (select (select (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_4086)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_4088) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_4088))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_4086)) .cse2 v_ArrVal_4090) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse2 v_ArrVal_4091) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))) is different from false [2021-12-14 19:49:54,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ (select (select (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_4086)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_4088) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8))) (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse1 v_ArrVal_4088))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse1 v_ArrVal_4086)) .cse2 v_ArrVal_4090) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse3) .cse2 v_ArrVal_4091) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-12-14 19:49:55,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ 8 (select (select (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4086)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4088) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_4088))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_4086)) .cse2 v_ArrVal_4090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) .cse2 v_ArrVal_4091) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))))) is different from false [2021-12-14 19:49:55,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (and (forall ((v_ArrVal_4084 Int) (v_ArrVal_4085 Int) (v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (<= 0 (+ 8 (select (select (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4084) .cse1 v_ArrVal_4086)) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_4085) .cse1 v_ArrVal_4088) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4090)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_4084 Int) (v_ArrVal_4085 Int) (v_ArrVal_4090 (Array Int Int)) (v_ArrVal_4091 (Array Int Int)) (v_ArrVal_4088 Int) (v_ArrVal_4086 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) (.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8))) (let ((.cse5 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_4085) .cse3 v_ArrVal_4088))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_4084) .cse3 v_ArrVal_4086)) .cse4 v_ArrVal_4090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5) .cse4 v_ArrVal_4091) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-14 19:49:56,045 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:56,046 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 247 treesize of output 224 [2021-12-14 19:49:56,070 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 1836 treesize of output 1828 [2021-12-14 19:49:56,080 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:56,088 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 1828 treesize of output 1452 [2021-12-14 19:49:56,112 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 5308 treesize of output 5210 [2021-12-14 19:49:56,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,149 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 4730 treesize of output 4632 [2021-12-14 19:49:56,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,193 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 4532 treesize of output 4510 [2021-12-14 19:49:56,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,275 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 4341 treesize of output 4309 [2021-12-14 19:49:56,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,311 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 4229 treesize of output 4213 [2021-12-14 19:49:56,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,362 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 3893 treesize of output 3829 [2021-12-14 19:49:56,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,389 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 3509 treesize of output 3445 [2021-12-14 19:49:56,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,410 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 3285 treesize of output 3253 [2021-12-14 19:49:56,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,429 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 2613 treesize of output 2485 [2021-12-14 19:49:56,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,459 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 2465 treesize of output 2461 [2021-12-14 19:49:56,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:56,479 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 2421 treesize of output 2413 [2021-12-14 19:49:56,511 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 886 treesize of output 870 [2021-12-14 19:49:56,744 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 1526 treesize of output 1462 [2021-12-14 19:49:56,755 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 1462 treesize of output 1398 [2021-12-14 19:49:57,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054273726] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:57,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:49:57,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 45 [2021-12-14 19:49:57,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625949953] [2021-12-14 19:49:57,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:57,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-14 19:49:57,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-14 19:49:57,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2910, Unknown=10, NotChecked=1044, Total=4160 [2021-12-14 19:49:57,257 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 41 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:49:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:59,182 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2021-12-14 19:49:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:49:59,182 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 41 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2021-12-14 19:49:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:59,183 INFO L225 Difference]: With dead ends: 162 [2021-12-14 19:49:59,183 INFO L226 Difference]: Without dead ends: 162 [2021-12-14 19:49:59,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=413, Invalid=4725, Unknown=10, NotChecked=1332, Total=6480 [2021-12-14 19:49:59,185 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 589 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:59,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 2206 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1366 Invalid, 0 Unknown, 98 Unchecked, 0.8s Time] [2021-12-14 19:49:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-14 19:49:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 94. [2021-12-14 19:49:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 90 states have internal predecessors, (95), 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:49:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-12-14 19:49:59,189 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 60 [2021-12-14 19:49:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:59,189 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-12-14 19:49:59,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 41 states have internal predecessors, (103), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:49:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-12-14 19:49:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-14 19:49:59,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:59,190 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-12-14 19:49:59,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:59,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:59,403 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash -258644372, now seen corresponding path program 1 times [2021-12-14 19:49:59,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:59,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108223173] [2021-12-14 19:49:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:59,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:49:59,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108223173] [2021-12-14 19:49:59,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108223173] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:59,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321734190] [2021-12-14 19:49:59,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:59,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:59,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:59,560 INFO L229 MonitoredProcess]: Starting monitored process 19 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:49:59,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-14 19:49:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:00,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:50:00,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:50:00,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:50:00,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321734190] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:00,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:00,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-14 19:50:00,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776425606] [2021-12-14 19:50:00,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:00,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:50:00,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:50:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:50:00,193 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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:50:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:00,294 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-12-14 19:50:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:50:00,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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 61 [2021-12-14 19:50:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:00,297 INFO L225 Difference]: With dead ends: 94 [2021-12-14 19:50:00,297 INFO L226 Difference]: Without dead ends: 94 [2021-12-14 19:50:00,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:50:00,298 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:00,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 316 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-14 19:50:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-14 19:50:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 90 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:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-12-14 19:50:00,301 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 61 [2021-12-14 19:50:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:00,301 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-12-14 19:50:00,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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:50:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-12-14 19:50:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-14 19:50:00,302 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:00,302 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:50:00,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:00,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:00,511 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:50:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1906011450, now seen corresponding path program 2 times [2021-12-14 19:50:00,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:00,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157182076] [2021-12-14 19:50:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:00,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:00,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:50:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:50:00,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:00,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157182076] [2021-12-14 19:50:00,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157182076] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:00,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126894595] [2021-12-14 19:50:00,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:50:00,586 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:00,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:00,587 INFO L229 MonitoredProcess]: Starting monitored process 20 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:00,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-14 19:50:01,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:50:01,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:50:01,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:50:01,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 19:50:01,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 19:50:01,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126894595] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:50:01,329 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:50:01,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-14 19:50:01,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278668005] [2021-12-14 19:50:01,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:50:01,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:50:01,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:50:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:50:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:50:01,333 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:01,430 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2021-12-14 19:50:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:50:01,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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 63 [2021-12-14 19:50:01,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:01,431 INFO L225 Difference]: With dead ends: 85 [2021-12-14 19:50:01,431 INFO L226 Difference]: Without dead ends: 85 [2021-12-14 19:50:01,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:50:01,431 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:01,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 256 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:50:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-14 19:50:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-14 19:50:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 81 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:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2021-12-14 19:50:01,434 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 63 [2021-12-14 19:50:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:01,434 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2021-12-14 19:50:01,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2021-12-14 19:50:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 19:50:01,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:01,435 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1] [2021-12-14 19:50:01,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:01,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:01,665 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:50:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1093757523, now seen corresponding path program 1 times [2021-12-14 19:50:01,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:01,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807194747] [2021-12-14 19:50:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:01,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:02,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:50:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:50:02,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:02,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807194747] [2021-12-14 19:50:02,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807194747] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:02,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392285892] [2021-12-14 19:50:02,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:02,631 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:02,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:02,636 INFO L229 MonitoredProcess]: Starting monitored process 21 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:02,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-14 19:50:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:02,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-14 19:50:02,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:02,942 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:03,162 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:50:03,163 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:03,224 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:03,273 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:03,273 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 26 treesize of output 27 [2021-12-14 19:50:03,360 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:03,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, 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:50:03,405 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:50:03,406 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 22 treesize of output 21 [2021-12-14 19:50:03,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:03,548 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:50:03,773 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:50:03,773 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 56 treesize of output 53 [2021-12-14 19:50:03,776 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 27 treesize of output 19 [2021-12-14 19:50:03,779 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 30 treesize of output 32 [2021-12-14 19:50:04,035 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 33 treesize of output 21 [2021-12-14 19:50:04,037 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 21 treesize of output 13 [2021-12-14 19:50:04,115 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:50:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:50:04,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:04,457 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 84 treesize of output 64 [2021-12-14 19:50:04,480 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_4680 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_4683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4683) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) is different from false [2021-12-14 19:50:04,499 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4680 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_4683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4683) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|))) is different from false [2021-12-14 19:50:04,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:50:04,511 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 38 treesize of output 37 [2021-12-14 19:50:04,515 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 13 treesize of output 11 [2021-12-14 19:50:06,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_4679 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4679) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false