./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_equal.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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:16:43,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:16:43,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:16:43,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:16:43,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:16:43,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:16:43,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:16:43,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:16:43,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:16:43,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:16:43,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:16:43,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:16:43,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:16:43,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:16:43,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:16:43,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:16:43,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:16:43,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:16:43,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:16:43,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:16:43,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:16:43,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:16:43,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:16:43,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:16:43,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:16:43,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:16:43,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:16:43,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:16:43,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:16:43,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:16:43,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:16:43,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:16:43,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:16:43,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:16:43,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:16:43,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:16:43,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:16:43,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:16:43,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:16:43,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:16:43,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:16:43,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-21 18:16:43,332 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:16:43,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:16:43,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:16:43,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:16:43,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:16:43,334 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:16:43,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:16:43,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:16:43,335 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:16:43,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:16:43,336 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:16:43,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:16:43,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:16:43,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:16:43,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:16:43,337 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:16:43,337 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:16:43,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:16:43,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:16:43,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:16:43,338 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:16:43,338 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:16:43,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:16:43,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:16:43,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:16:43,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:16:43,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:16:43,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:16:43,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:16:43,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:16:43,340 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:16:43,341 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2021-12-21 18:16:43,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:16:43,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:16:43,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:16:43,621 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:16:43,622 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:16:43,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2021-12-21 18:16:43,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb6d1b29f/7a5e6198311c47d58c4a020c2b14ffa2/FLAGdcc893d9d [2021-12-21 18:16:44,151 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:16:44,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2021-12-21 18:16:44,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb6d1b29f/7a5e6198311c47d58c4a020c2b14ffa2/FLAGdcc893d9d [2021-12-21 18:16:44,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb6d1b29f/7a5e6198311c47d58c4a020c2b14ffa2 [2021-12-21 18:16:44,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:16:44,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:16:44,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:16:44,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:16:44,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:16:44,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b662f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44, skipping insertion in model container [2021-12-21 18:16:44,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:16:44,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:16:44,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2021-12-21 18:16:44,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:16:44,772 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:16:44,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2021-12-21 18:16:44,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:16:44,831 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:16:44,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44 WrapperNode [2021-12-21 18:16:44,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:16:44,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:16:44,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:16:44,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:16:44,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,881 INFO L137 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2021-12-21 18:16:44,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:16:44,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:16:44,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:16:44,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:16:44,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:16:44,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:16:44,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:16:44,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:16:44,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (1/1) ... [2021-12-21 18:16:44,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:16:44,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:44,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 18:16:44,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 18:16:44,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 18:16:44,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 18:16:44,965 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 18:16:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:16:44,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:16:45,052 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:16:45,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:16:45,376 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:16:45,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:16:45,388 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 18:16:45,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:16:45 BoogieIcfgContainer [2021-12-21 18:16:45,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:16:45,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:16:45,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:16:45,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:16:45,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:16:44" (1/3) ... [2021-12-21 18:16:45,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fa51e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:16:45, skipping insertion in model container [2021-12-21 18:16:45,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:44" (2/3) ... [2021-12-21 18:16:45,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fa51e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:16:45, skipping insertion in model container [2021-12-21 18:16:45,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:16:45" (3/3) ... [2021-12-21 18:16:45,400 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2021-12-21 18:16:45,404 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:16:45,405 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2021-12-21 18:16:45,455 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:16:45,463 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 18:16:45,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2021-12-21 18:16:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 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-21 18:16:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-21 18:16:45,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:45,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-21 18:16:45,499 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:45,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2021-12-21 18:16:45,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:45,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075577778] [2021-12-21 18:16:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:45,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:16:45,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:45,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075577778] [2021-12-21 18:16:45,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075577778] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:45,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:45,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:16:45,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560510783] [2021-12-21 18:16:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:45,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:16:45,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:45,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:16:45,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:45,772 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 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) 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-21 18:16:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:45,902 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-12-21 18:16:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:16:45,905 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-21 18:16:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:45,919 INFO L225 Difference]: With dead ends: 114 [2021-12-21 18:16:45,919 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 18:16:45,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:45,924 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:45,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 18:16:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-21 18:16:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 states have internal predecessors, (113), 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-21 18:16:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2021-12-21 18:16:45,969 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2021-12-21 18:16:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:45,970 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2021-12-21 18:16:45,970 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-21 18:16:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2021-12-21 18:16:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-21 18:16:45,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:45,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-21 18:16:45,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 18:16:45,972 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2021-12-21 18:16:45,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:45,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584694174] [2021-12-21 18:16:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:45,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:16:46,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:46,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584694174] [2021-12-21 18:16:46,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584694174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:46,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:46,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:16:46,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164708546] [2021-12-21 18:16:46,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:46,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:16:46,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:46,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:16:46,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:46,021 INFO L87 Difference]: Start difference. First operand 111 states and 119 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-21 18:16:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:46,098 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-12-21 18:16:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:16:46,098 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-21 18:16:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:46,101 INFO L225 Difference]: With dead ends: 109 [2021-12-21 18:16:46,101 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 18:16:46,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:46,107 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:46,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 18:16:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-21 18:16:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 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-21 18:16:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2021-12-21 18:16:46,123 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2021-12-21 18:16:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:46,124 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2021-12-21 18:16:46,124 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-21 18:16:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2021-12-21 18:16:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 18:16:46,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:46,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:46,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 18:16:46,126 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:46,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2021-12-21 18:16:46,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:46,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738780086] [2021-12-21 18:16:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:46,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:16:46,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:46,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738780086] [2021-12-21 18:16:46,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738780086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:46,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:46,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:16:46,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559711347] [2021-12-21 18:16:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:46,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:16:46,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:16:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:16:46,252 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:16:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:46,349 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-12-21 18:16:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:16:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-21 18:16:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:46,353 INFO L225 Difference]: With dead ends: 116 [2021-12-21 18:16:46,353 INFO L226 Difference]: Without dead ends: 116 [2021-12-21 18:16:46,354 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-21 18:16:46,359 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:46,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-21 18:16:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2021-12-21 18:16:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-12-21 18:16:46,380 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2021-12-21 18:16:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:46,381 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-12-21 18:16:46,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 18:16:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-12-21 18:16:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:16:46,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:46,382 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:46,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 18:16:46,383 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2021-12-21 18:16:46,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:46,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303247103] [2021-12-21 18:16:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:46,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:16:46,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:46,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303247103] [2021-12-21 18:16:46,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303247103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:46,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:46,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:16:46,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138726119] [2021-12-21 18:16:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:46,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:16:46,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:16:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:46,510 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:16:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:46,737 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2021-12-21 18:16:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:16:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-21 18:16:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:46,739 INFO L225 Difference]: With dead ends: 110 [2021-12-21 18:16:46,740 INFO L226 Difference]: Without dead ends: 110 [2021-12-21 18:16:46,740 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-21 18:16:46,747 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:46,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-21 18:16:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2021-12-21 18:16:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 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-21 18:16:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2021-12-21 18:16:46,764 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2021-12-21 18:16:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:46,764 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2021-12-21 18:16:46,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:16:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2021-12-21 18:16:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:16:46,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:46,765 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:46,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 18:16:46,766 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2021-12-21 18:16:46,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:46,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627663567] [2021-12-21 18:16:46,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:46,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:16:46,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:46,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627663567] [2021-12-21 18:16:46,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627663567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:46,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:46,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:16:46,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191427195] [2021-12-21 18:16:46,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:46,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:16:46,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:46,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:16:46,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:46,903 INFO L87 Difference]: Start difference. First operand 109 states and 117 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-21 18:16:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:47,110 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2021-12-21 18:16:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:16:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-21 18:16:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:47,116 INFO L225 Difference]: With dead ends: 109 [2021-12-21 18:16:47,116 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 18:16:47,116 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-21 18:16:47,117 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:47,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 18:16:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2021-12-21 18:16:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2021-12-21 18:16:47,121 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2021-12-21 18:16:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:47,121 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2021-12-21 18:16:47,122 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-21 18:16:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2021-12-21 18:16:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 18:16:47,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:47,123 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:47,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 18:16:47,123 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2021-12-21 18:16:47,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:47,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658842563] [2021-12-21 18:16:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:47,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:47,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:16:47,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:47,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658842563] [2021-12-21 18:16:47,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658842563] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:47,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523740461] [2021-12-21 18:16:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:47,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:47,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:47,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:16:47,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 18:16:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:47,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-21 18:16:47,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:47,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:47,588 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:16:47,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-21 18:16:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:16:47,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:16:47,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523740461] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:47,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:16:47,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2021-12-21 18:16:47,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872542625] [2021-12-21 18:16:47,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:47,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 18:16:47,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 18:16:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:16:47,992 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 18:16:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:48,234 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2021-12-21 18:16:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:16:48,234 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2021-12-21 18:16:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:48,235 INFO L225 Difference]: With dead ends: 114 [2021-12-21 18:16:48,235 INFO L226 Difference]: Without dead ends: 114 [2021-12-21 18:16:48,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:16:48,236 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 31 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:48,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 657 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 179 Unchecked, 0.2s Time] [2021-12-21 18:16:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-21 18:16:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-12-21 18:16:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2021-12-21 18:16:48,240 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 25 [2021-12-21 18:16:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:48,240 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2021-12-21 18:16:48,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-21 18:16:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2021-12-21 18:16:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 18:16:48,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:48,241 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:48,267 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-21 18:16:48,451 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-21 18:16:48,452 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2021-12-21 18:16:48,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:48,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128994601] [2021-12-21 18:16:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:48,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:48,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:48,683 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-21 18:16:48,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:48,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128994601] [2021-12-21 18:16:48,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128994601] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:48,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489974921] [2021-12-21 18:16:48,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:48,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:48,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:48,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:16:48,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 18:16:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:48,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-21 18:16:48,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:48,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:49,055 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:16:49,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:16:49,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2021-12-21 18:16:49,124 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-21 18:16:49,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:49,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489974921] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:49,270 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:49,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-12-21 18:16:49,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093324521] [2021-12-21 18:16:49,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:49,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 18:16:49,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 18:16:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:16:49,271 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 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-21 18:16:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:49,780 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-12-21 18:16:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:16:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-12-21 18:16:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:49,781 INFO L225 Difference]: With dead ends: 115 [2021-12-21 18:16:49,781 INFO L226 Difference]: Without dead ends: 115 [2021-12-21 18:16:49,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2021-12-21 18:16:49,782 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 209 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:49,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 590 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:16:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-21 18:16:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2021-12-21 18:16:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-21 18:16:49,785 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 25 [2021-12-21 18:16:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:49,786 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-21 18:16:49,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 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-21 18:16:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-21 18:16:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 18:16:49,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:49,787 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:49,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:49,987 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-21 18:16:49,987 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2021-12-21 18:16:49,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:49,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929852918] [2021-12-21 18:16:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:49,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:50,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:50,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:50,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929852918] [2021-12-21 18:16:50,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929852918] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:50,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300453861] [2021-12-21 18:16:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:50,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:50,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:50,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:16:50,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 18:16:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:50,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 18:16:50,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:50,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:50,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:16:50,549 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:16:50,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-21 18:16:50,659 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:16:50,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:16:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 18:16:50,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:51,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300453861] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:51,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:51,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2021-12-21 18:16:51,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433666423] [2021-12-21 18:16:51,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:51,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-21 18:16:51,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:51,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-21 18:16:51,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:16:51,071 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 18:16:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:51,270 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2021-12-21 18:16:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:16:51,270 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2021-12-21 18:16:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:51,271 INFO L225 Difference]: With dead ends: 127 [2021-12-21 18:16:51,271 INFO L226 Difference]: Without dead ends: 127 [2021-12-21 18:16:51,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2021-12-21 18:16:51,272 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 182 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:51,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 400 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 204 Invalid, 0 Unknown, 177 Unchecked, 0.1s Time] [2021-12-21 18:16:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-21 18:16:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2021-12-21 18:16:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.621212121212121) internal successors, (107), 100 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-12-21 18:16:51,275 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 37 [2021-12-21 18:16:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:51,276 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-12-21 18:16:51,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 18:16:51,276 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-12-21 18:16:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 18:16:51,276 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:51,276 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:51,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:51,477 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-21 18:16:51,477 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2021-12-21 18:16:51,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:51,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242820549] [2021-12-21 18:16:51,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:51,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 18:16:51,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:51,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242820549] [2021-12-21 18:16:51,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242820549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:51,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:51,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:16:51,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566390472] [2021-12-21 18:16:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:51,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:16:51,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:51,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:16:51,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:16:51,661 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:51,916 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2021-12-21 18:16:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:16:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2021-12-21 18:16:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:51,918 INFO L225 Difference]: With dead ends: 116 [2021-12-21 18:16:51,918 INFO L226 Difference]: Without dead ends: 116 [2021-12-21 18:16:51,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:16:51,918 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 184 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:51,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 204 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-21 18:16:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2021-12-21 18:16:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2021-12-21 18:16:51,922 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 37 [2021-12-21 18:16:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:51,922 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2021-12-21 18:16:51,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2021-12-21 18:16:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 18:16:51,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:51,923 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:51,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 18:16:51,923 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2021-12-21 18:16:51,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:51,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961410248] [2021-12-21 18:16:51,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:51,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:51,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-21 18:16:52,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:52,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961410248] [2021-12-21 18:16:52,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961410248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:52,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:52,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:16:52,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896010958] [2021-12-21 18:16:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:52,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:16:52,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:16:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:52,035 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 18:16:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:52,175 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2021-12-21 18:16:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:16:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-12-21 18:16:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:52,176 INFO L225 Difference]: With dead ends: 114 [2021-12-21 18:16:52,176 INFO L226 Difference]: Without dead ends: 114 [2021-12-21 18:16:52,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-21 18:16:52,177 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 69 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:52,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 266 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-21 18:16:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2021-12-21 18:16:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2021-12-21 18:16:52,180 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 39 [2021-12-21 18:16:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:52,180 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2021-12-21 18:16:52,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 18:16:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2021-12-21 18:16:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 18:16:52,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:52,183 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:52,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 18:16:52,183 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2021-12-21 18:16:52,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:52,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064975009] [2021-12-21 18:16:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:52,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-21 18:16:52,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064975009] [2021-12-21 18:16:52,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064975009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:52,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:52,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:16:52,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917654980] [2021-12-21 18:16:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:52,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:16:52,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:16:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:52,313 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 18:16:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:52,450 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-21 18:16:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:16:52,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-12-21 18:16:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:52,452 INFO L225 Difference]: With dead ends: 94 [2021-12-21 18:16:52,452 INFO L226 Difference]: Without dead ends: 94 [2021-12-21 18:16:52,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-21 18:16:52,452 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:52,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 281 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-21 18:16:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-21 18:16:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-12-21 18:16:52,455 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 39 [2021-12-21 18:16:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:52,455 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-12-21 18:16:52,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-21 18:16:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-12-21 18:16:52,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 18:16:52,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:52,456 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:52,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 18:16:52,456 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2021-12-21 18:16:52,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:52,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135041106] [2021-12-21 18:16:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:52,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 18:16:52,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:52,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135041106] [2021-12-21 18:16:52,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135041106] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:52,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463248619] [2021-12-21 18:16:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:52,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:52,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:52,795 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-21 18:16:52,821 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-21 18:16:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:52,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-21 18:16:52,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:53,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-12-21 18:16:53,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:53,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:16:53,341 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-21 18:16:53,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:16:53,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-21 18:16:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 18:16:53,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:53,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463248619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:53,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:16:53,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2021-12-21 18:16:53,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630866665] [2021-12-21 18:16:53,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:53,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 18:16:53,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:53,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 18:16:53,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=622, Unknown=2, NotChecked=0, Total=702 [2021-12-21 18:16:53,444 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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-21 18:16:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:53,693 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2021-12-21 18:16:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 18:16:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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-21 18:16:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:53,694 INFO L225 Difference]: With dead ends: 137 [2021-12-21 18:16:53,694 INFO L226 Difference]: Without dead ends: 137 [2021-12-21 18:16:53,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=756, Unknown=2, NotChecked=0, Total=870 [2021-12-21 18:16:53,695 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:53,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 692 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 379 Invalid, 0 Unknown, 138 Unchecked, 0.2s Time] [2021-12-21 18:16:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-21 18:16:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2021-12-21 18:16:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2021-12-21 18:16:53,697 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 41 [2021-12-21 18:16:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:53,698 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2021-12-21 18:16:53,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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-21 18:16:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2021-12-21 18:16:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 18:16:53,698 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:53,698 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:53,724 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-21 18:16:53,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:53,903 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2021-12-21 18:16:53,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:53,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872196432] [2021-12-21 18:16:53,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:53,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:54,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:16:54,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872196432] [2021-12-21 18:16:54,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872196432] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822730615] [2021-12-21 18:16:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:54,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:54,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:54,474 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-21 18:16:54,506 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-21 18:16:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:54,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-21 18:16:54,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:54,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:55,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-21 18:16:55,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 18:16:55,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:55,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-21 18:16:55,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:55,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 18:16:55,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:55,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:16:55,352 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-21 18:16:55,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-21 18:16:55,408 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-21 18:16:55,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:16:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:16:55,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:55,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822730615] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:55,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:55,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2021-12-21 18:16:55,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636841894] [2021-12-21 18:16:55,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:55,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-21 18:16:55,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:55,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-21 18:16:55,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1138, Unknown=2, NotChecked=0, Total=1260 [2021-12-21 18:16:55,687 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 18:16:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:56,782 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2021-12-21 18:16:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:16:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2021-12-21 18:16:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:56,783 INFO L225 Difference]: With dead ends: 147 [2021-12-21 18:16:56,783 INFO L226 Difference]: Without dead ends: 147 [2021-12-21 18:16:56,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=246, Invalid=2008, Unknown=2, NotChecked=0, Total=2256 [2021-12-21 18:16:56,784 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 258 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:56,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 1228 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1375 Invalid, 0 Unknown, 76 Unchecked, 0.7s Time] [2021-12-21 18:16:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-21 18:16:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97. [2021-12-21 18:16:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-21 18:16:56,788 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 41 [2021-12-21 18:16:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:56,788 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-21 18:16:56,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 18:16:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-21 18:16:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 18:16:56,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:56,790 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:56,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-21 18:16:56,999 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,SelfDestructingSolverStorable12 [2021-12-21 18:16:57,000 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:57,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1333284459, now seen corresponding path program 1 times [2021-12-21 18:16:57,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:57,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501546646] [2021-12-21 18:16:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:57,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 18:16:57,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:57,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501546646] [2021-12-21 18:16:57,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501546646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:57,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:57,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:16:57,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278702708] [2021-12-21 18:16:57,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:57,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:16:57,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:57,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:16:57,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:16:57,112 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 18:16:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:57,182 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-12-21 18:16:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:16:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2021-12-21 18:16:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:57,184 INFO L225 Difference]: With dead ends: 114 [2021-12-21 18:16:57,184 INFO L226 Difference]: Without dead ends: 114 [2021-12-21 18:16:57,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:16:57,184 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:57,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 177 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-21 18:16:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2021-12-21 18:16:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.380281690140845) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-12-21 18:16:57,188 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 42 [2021-12-21 18:16:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:57,188 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-12-21 18:16:57,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 18:16:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-12-21 18:16:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 18:16:57,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:57,190 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:57,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 18:16:57,190 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2021-12-21 18:16:57,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:57,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457170060] [2021-12-21 18:16:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:57,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-21 18:16:57,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:57,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457170060] [2021-12-21 18:16:57,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457170060] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:57,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:57,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:16:57,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067866244] [2021-12-21 18:16:57,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:57,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:16:57,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:57,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:16:57,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:16:57,357 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 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-21 18:16:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:57,568 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2021-12-21 18:16:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 18:16:57,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 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 44 [2021-12-21 18:16:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:57,570 INFO L225 Difference]: With dead ends: 159 [2021-12-21 18:16:57,570 INFO L226 Difference]: Without dead ends: 159 [2021-12-21 18:16:57,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-12-21 18:16:57,571 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 268 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:57,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 398 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-21 18:16:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 99. [2021-12-21 18:16:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.36) internal successors, (102), 93 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2021-12-21 18:16:57,577 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 44 [2021-12-21 18:16:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:57,577 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2021-12-21 18:16:57,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 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-21 18:16:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2021-12-21 18:16:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 18:16:57,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:57,578 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:57,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 18:16:57,578 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2021-12-21 18:16:57,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:57,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8384331] [2021-12-21 18:16:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:57,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-21 18:16:57,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:57,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8384331] [2021-12-21 18:16:57,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8384331] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:57,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:57,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:16:57,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764456592] [2021-12-21 18:16:57,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:57,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:16:57,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:57,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:16:57,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:16:57,738 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 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-21 18:16:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:57,971 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2021-12-21 18:16:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:16:57,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 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 44 [2021-12-21 18:16:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:57,972 INFO L225 Difference]: With dead ends: 141 [2021-12-21 18:16:57,973 INFO L226 Difference]: Without dead ends: 141 [2021-12-21 18:16:57,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:16:57,973 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 275 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:57,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 400 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-21 18:16:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2021-12-21 18:16:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2021-12-21 18:16:57,977 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 44 [2021-12-21 18:16:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:57,977 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2021-12-21 18:16:57,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 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-21 18:16:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2021-12-21 18:16:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:16:57,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:57,977 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:57,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 18:16:57,978 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:57,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2021-12-21 18:16:57,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:57,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641568880] [2021-12-21 18:16:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:57,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:58,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:58,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:16:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:16:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:16:58,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:58,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641568880] [2021-12-21 18:16:58,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641568880] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:58,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147079007] [2021-12-21 18:16:58,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:58,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:58,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:58,253 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-21 18:16:58,254 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-21 18:16:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:58,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-21 18:16:58,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:58,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-21 18:16:58,788 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1662 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1662)))) is different from true [2021-12-21 18:16:58,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:58,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-21 18:16:58,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 18:16:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-12-21 18:16:58,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:58,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1666 (Array Int Int)) (|v_node_create_~temp~0#1.base_38| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_38| v_ArrVal_1666) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (not (< |v_node_create_~temp~0#1.base_38| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0)))) is different from false [2021-12-21 18:16:58,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147079007] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:58,981 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:58,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2021-12-21 18:16:58,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425245696] [2021-12-21 18:16:58,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:58,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-21 18:16:58,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:58,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 18:16:58,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2021-12-21 18:16:58,983 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 18:16:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:59,486 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-21 18:16:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 18:16:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2021-12-21 18:16:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:59,489 INFO L225 Difference]: With dead ends: 97 [2021-12-21 18:16:59,489 INFO L226 Difference]: Without dead ends: 97 [2021-12-21 18:16:59,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2021-12-21 18:16:59,490 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 292 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:59,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 580 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 439 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2021-12-21 18:16:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-21 18:16:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2021-12-21 18:16:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-12-21 18:16:59,493 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 46 [2021-12-21 18:16:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:59,493 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-12-21 18:16:59,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 18:16:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-12-21 18:16:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:16:59,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:59,494 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:59,520 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-21 18:16:59,695 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-21 18:16:59,695 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:16:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:59,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2021-12-21 18:16:59,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:59,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904454502] [2021-12-21 18:16:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:59,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:17:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:00,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:17:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:17:00,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:17:00,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904454502] [2021-12-21 18:17:00,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904454502] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:00,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203242016] [2021-12-21 18:17:00,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:17:00,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:17:00,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:17:00,432 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-21 18:17:00,459 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-21 18:17:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:00,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-21 18:17:00,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:17:00,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:17:00,853 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:17:00,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:17:00,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:17:01,075 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:17:01,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:17:01,255 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:17:01,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2021-12-21 18:17:01,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 18:17:01,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:01,557 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 18:17:01,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2021-12-21 18:17:01,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:01,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 18:17:01,589 INFO L353 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2021-12-21 18:17:01,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2021-12-21 18:17:01,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:17:02,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:17:02,162 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 18:17:02,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 36 [2021-12-21 18:17:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:17:02,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:17:02,523 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int)) (|v_node_create_~temp~0#1.base_41| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_41| v_ArrVal_1838) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_41|) 0)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_41| 1) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41| v_ArrVal_1837))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) .cse1)) 1) (not (< |v_node_create_~temp~0#1.base_41| |c_#StackHeapBarrier|)) (< .cse1 0)))) is different from false [2021-12-21 18:17:02,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203242016] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:02,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:17:02,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 48 [2021-12-21 18:17:02,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390913851] [2021-12-21 18:17:02,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:17:02,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-21 18:17:02,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:17:02,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-21 18:17:02,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2475, Unknown=3, NotChecked=100, Total=2756 [2021-12-21 18:17:02,527 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 18:17:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:17:03,404 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2021-12-21 18:17:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 18:17:03,405 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2021-12-21 18:17:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:17:03,406 INFO L225 Difference]: With dead ends: 115 [2021-12-21 18:17:03,406 INFO L226 Difference]: Without dead ends: 115 [2021-12-21 18:17:03,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=296, Invalid=3862, Unknown=6, NotChecked=126, Total=4290 [2021-12-21 18:17:03,408 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:17:03,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1035 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 573 Invalid, 0 Unknown, 235 Unchecked, 0.3s Time] [2021-12-21 18:17:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-21 18:17:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2021-12-21 18:17:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 105 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:17:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2021-12-21 18:17:03,411 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 46 [2021-12-21 18:17:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:17:03,411 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2021-12-21 18:17:03,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 42 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 18:17:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2021-12-21 18:17:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:17:03,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:17:03,412 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:17:03,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 18:17:03,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:17:03,613 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:17:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:17:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2021-12-21 18:17:03,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:17:03,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15862026] [2021-12-21 18:17:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:17:03,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:17:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:17:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:17:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:17:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:17:04,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:17:04,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15862026] [2021-12-21 18:17:04,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15862026] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:04,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661459732] [2021-12-21 18:17:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:17:04,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:17:04,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:17:04,575 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-21 18:17:04,583 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-21 18:17:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:04,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 119 conjunts are in the unsatisfiable core [2021-12-21 18:17:04,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:17:04,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:17:05,151 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:17:05,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 18:17:05,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:17:05,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:17:05,485 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:17:05,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-21 18:17:05,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 18:17:05,728 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:17:05,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2021-12-21 18:17:05,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:17:05,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2021-12-21 18:17:05,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:17:06,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:06,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-21 18:17:06,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:06,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:06,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:06,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-21 18:17:06,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:06,100 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 18:17:06,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2021-12-21 18:17:06,114 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 18:17:06,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 18:17:06,469 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 18:17:06,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2021-12-21 18:17:06,477 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:17:06,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-21 18:17:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:17:06,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:17:07,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2015 (Array Int Int)) (|v_node_create_~temp~0#1.base_44| Int)) (or (and (forall ((v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2016 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_44| v_ArrVal_2015)) (.cse3 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_44| v_ArrVal_2014))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 4) (select (store |c_#length| |v_node_create_~temp~0#1.base_44| v_ArrVal_2016) (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_2014 (Array Int Int))) (<= 0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_44| v_ArrVal_2015))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_44| v_ArrVal_2014) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (< (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_44| v_ArrVal_2015) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0) (not (< |v_node_create_~temp~0#1.base_44| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_44|) 0)))) is different from false [2021-12-21 18:17:07,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661459732] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:07,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:17:07,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2021-12-21 18:17:07,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583642616] [2021-12-21 18:17:07,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:17:07,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-21 18:17:07,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:17:07,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-21 18:17:07,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3120, Unknown=4, NotChecked=112, Total=3422 [2021-12-21 18:17:07,027 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 18:17:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:17:08,789 INFO L93 Difference]: Finished difference Result 220 states and 240 transitions. [2021-12-21 18:17:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-21 18:17:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2021-12-21 18:17:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:17:08,791 INFO L225 Difference]: With dead ends: 220 [2021-12-21 18:17:08,791 INFO L226 Difference]: Without dead ends: 220 [2021-12-21 18:17:08,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=369, Invalid=5178, Unknown=7, NotChecked=146, Total=5700 [2021-12-21 18:17:08,793 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 192 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 18:17:08,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 1803 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1301 Invalid, 0 Unknown, 355 Unchecked, 0.6s Time] [2021-12-21 18:17:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-21 18:17:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2021-12-21 18:17:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.313953488372093) internal successors, (113), 104 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 18:17:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2021-12-21 18:17:08,798 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 46 [2021-12-21 18:17:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:17:08,798 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2021-12-21 18:17:08,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-21 18:17:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2021-12-21 18:17:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 18:17:08,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:17:08,799 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:17:08,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-21 18:17:09,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:17:09,007 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:17:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:17:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2021-12-21 18:17:09,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:17:09,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667284829] [2021-12-21 18:17:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:17:09,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:17:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:17:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:09,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:17:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:17:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:17:09,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:17:09,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667284829] [2021-12-21 18:17:09,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667284829] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:09,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722221338] [2021-12-21 18:17:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:17:09,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:17:09,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:17:09,580 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-21 18:17:09,606 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-21 18:17:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:09,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-21 18:17:09,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:17:09,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:17:09,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:17:09,925 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:17:09,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:17:09,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:17:10,052 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:17:10,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:17:10,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-21 18:17:10,611 INFO L353 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-12-21 18:17:10,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-12-21 18:17:10,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:10,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-21 18:17:10,922 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:17:10,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-21 18:17:10,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:10,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-21 18:17:11,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 18:17:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:17:11,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:17:11,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2200) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2021-12-21 18:17:11,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2200) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2021-12-21 18:17:11,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| Int) (v_ArrVal_2207 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2208 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| v_ArrVal_2208) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| v_ArrVal_2207))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2200)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| v_ArrVal_2201) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_25| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 18:17:11,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722221338] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:11,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:17:11,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2021-12-21 18:17:11,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42093360] [2021-12-21 18:17:11,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:17:11,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-21 18:17:11,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:17:11,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-21 18:17:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2037, Unknown=85, NotChecked=282, Total=2550 [2021-12-21 18:17:11,409 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 18:17:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:17:13,326 INFO L93 Difference]: Finished difference Result 320 states and 348 transitions. [2021-12-21 18:17:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-21 18:17:13,327 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2021-12-21 18:17:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:17:13,329 INFO L225 Difference]: With dead ends: 320 [2021-12-21 18:17:13,329 INFO L226 Difference]: Without dead ends: 320 [2021-12-21 18:17:13,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=424, Invalid=5186, Unknown=102, NotChecked=450, Total=6162 [2021-12-21 18:17:13,331 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 725 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 18:17:13,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [725 Valid, 1364 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1389 Invalid, 0 Unknown, 233 Unchecked, 0.7s Time] [2021-12-21 18:17:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-12-21 18:17:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 147. [2021-12-21 18:17:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 119 states have (on average 1.3025210084033614) internal successors, (155), 137 states have internal predecessors, (155), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 18:17:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2021-12-21 18:17:13,337 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 51 [2021-12-21 18:17:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:17:13,338 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2021-12-21 18:17:13,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 18:17:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2021-12-21 18:17:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 18:17:13,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:17:13,339 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:17:13,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 18:17:13,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:17:13,551 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:17:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:17:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2021-12-21 18:17:13,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:17:13,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388619431] [2021-12-21 18:17:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:17:13,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:17:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:13,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:17:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:17:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:17:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:17:14,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:17:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388619431] [2021-12-21 18:17:14,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388619431] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475967926] [2021-12-21 18:17:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:17:14,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:17:14,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:17:14,356 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-21 18:17:14,357 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-21 18:17:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:14,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-21 18:17:14,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:17:14,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:17:14,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:17:14,663 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:17:14,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 18:17:14,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:17:14,808 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:17:14,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:17:15,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-21 18:17:15,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-21 18:17:15,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:15,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2021-12-21 18:17:15,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:15,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-21 18:17:15,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:15,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-21 18:17:15,458 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-21 18:17:15,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-21 18:17:15,775 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:17:15,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2021-12-21 18:17:15,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2021-12-21 18:17:15,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:15,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-21 18:17:15,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:15,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-21 18:17:15,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-12-21 18:17:15,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-21 18:17:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:17:16,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:17:16,184 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2021-12-21 18:17:16,203 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2395) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-21 18:17:16,231 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2395) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-21 18:17:16,242 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2395) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2021-12-21 18:17:16,268 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2396) |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| .cse0 v_ArrVal_2395) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2394) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-21 18:17:16,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475967926] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:16,539 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:17:16,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2021-12-21 18:17:16,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131302585] [2021-12-21 18:17:16,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:17:16,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-21 18:17:16,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:17:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-21 18:17:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2582, Unknown=9, NotChecked=530, Total=3306 [2021-12-21 18:17:16,541 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 49 states, 46 states have (on average 1.934782608695652) internal successors, (89), 42 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 18:17:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:17:18,328 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2021-12-21 18:17:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-21 18:17:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.934782608695652) internal successors, (89), 42 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2021-12-21 18:17:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:17:18,330 INFO L225 Difference]: With dead ends: 260 [2021-12-21 18:17:18,330 INFO L226 Difference]: Without dead ends: 260 [2021-12-21 18:17:18,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=413, Invalid=4996, Unknown=13, NotChecked=740, Total=6162 [2021-12-21 18:17:18,332 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 561 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 18:17:18,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 1411 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1398 Invalid, 0 Unknown, 94 Unchecked, 0.7s Time] [2021-12-21 18:17:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-21 18:17:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 164. [2021-12-21 18:17:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 154 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 18:17:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 188 transitions. [2021-12-21 18:17:18,337 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 188 transitions. Word has length 51 [2021-12-21 18:17:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:17:18,338 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 188 transitions. [2021-12-21 18:17:18,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.934782608695652) internal successors, (89), 42 states have internal predecessors, (89), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-21 18:17:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2021-12-21 18:17:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 18:17:18,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:17:18,339 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-21 18:17:18,357 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-21 18:17:18,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-21 18:17:18,543 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 46 more)] === [2021-12-21 18:17:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:17:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2021-12-21 18:17:18,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:17:18,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630710138] [2021-12-21 18:17:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:17:18,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:17:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:17:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:18,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 18:17:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-21 18:17:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:17:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 18:17:19,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:17:19,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630710138] [2021-12-21 18:17:19,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630710138] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:17:19,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973120932] [2021-12-21 18:17:19,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:17:19,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:17:19,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:17:19,336 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-21 18:17:19,371 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-21 18:17:19,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 18:17:19,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:17:19,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 133 conjunts are in the unsatisfiable core [2021-12-21 18:17:19,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:17:19,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:17:19,845 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:17:19,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:17:19,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:17:19,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:17:20,124 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-21 18:17:20,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-12-21 18:17:20,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 18:17:38,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:38,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:38,597 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-21 18:17:38,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2021-12-21 18:17:38,627 INFO L353 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2021-12-21 18:17:38,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 70 [2021-12-21 18:17:38,644 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-21 18:17:38,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-21 18:17:39,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:17:39,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:39,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:17:39,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:17:40,000 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:17:40,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2021-12-21 18:17:40,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:17:40,411 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unexpected substitution problem. [2021-12-21 18:17:40,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:17:40,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2021-12-21 18:17:40,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792781530] [2021-12-21 18:17:40,411 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 18:17:40,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-21 18:17:40,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:17:40,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-21 18:17:40,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3008, Unknown=9, NotChecked=0, Total=3192 [2021-12-21 18:17:40,412 INFO L87 Difference]: Start difference. First operand 164 states and 188 transitions. Second operand has 29 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)