./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.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 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:12:41,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:12:41,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:12:41,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:12:41,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:12:41,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:12:41,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:12:41,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:12:41,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:12:41,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:12:41,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:12:41,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:12:41,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:12:41,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:12:41,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:12:41,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:12:41,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:12:41,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:12:41,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:12:41,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:12:41,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:12:41,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:12:41,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:12:41,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:12:41,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:12:41,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:12:41,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:12:41,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:12:41,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:12:41,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:12:41,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:12:41,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:12:41,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:12:41,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:12:41,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:12:41,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:12:41,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:12:41,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:12:41,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:12:41,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:12:41,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:12:41,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 00:12:41,585 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:12:41,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:12:41,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:12:41,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:12:41,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:12:41,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:12:41,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:12:41,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:12:41,588 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:12:41,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:12:41,589 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:12:41,589 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:12:41,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:12:41,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:12:41,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:12:41,590 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:12:41,590 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:12:41,590 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:12:41,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:12:41,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:12:41,591 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:12:41,594 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:12:41,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:12:41,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:12:41,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:12:41,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:12:41,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:12:41,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:12:41,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 00:12:41,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 00:12:41,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:12:41,597 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 -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2021-12-22 00:12:41,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:12:41,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:12:41,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:12:41,786 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:12:41,787 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:12:41,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-22 00:12:41,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5773ed1fd/ef7a3c9b4a84483697b788fdac143cb1/FLAG5464027d9 [2021-12-22 00:12:42,256 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:12:42,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-22 00:12:42,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5773ed1fd/ef7a3c9b4a84483697b788fdac143cb1/FLAG5464027d9 [2021-12-22 00:12:42,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5773ed1fd/ef7a3c9b4a84483697b788fdac143cb1 [2021-12-22 00:12:42,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:12:42,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:12:42,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:12:42,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:12:42,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:12:42,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345c3d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42, skipping insertion in model container [2021-12-22 00:12:42,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:12:42,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:12:42,477 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/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-22 00:12:42,479 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/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-22 00:12:42,482 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/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-22 00:12:42,483 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/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-22 00:12:42,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:12:42,492 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:12:42,534 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/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-22 00:12:42,534 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/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-22 00:12:42,536 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/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-22 00:12:42,548 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/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-22 00:12:42,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:12:42,571 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:12:42,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42 WrapperNode [2021-12-22 00:12:42,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:12:42,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:12:42,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:12:42,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:12:42,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,605 INFO L137 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2021-12-22 00:12:42,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:12:42,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:12:42,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:12:42,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:12:42,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:12:42,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:12:42,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:12:42,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:12:42,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (1/1) ... [2021-12-22 00:12:42,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:12:42,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:42,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 00:12:42,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 00:12:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 00:12:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 00:12:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:12:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:12:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:12:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:12:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:12:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 00:12:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:12:42,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:12:42,766 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:12:42,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:12:42,998 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:12:43,003 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:12:43,003 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-22 00:12:43,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:43 BoogieIcfgContainer [2021-12-22 00:12:43,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:12:43,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:12:43,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:12:43,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:12:43,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:12:42" (1/3) ... [2021-12-22 00:12:43,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dcd98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:12:43, skipping insertion in model container [2021-12-22 00:12:43,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:42" (2/3) ... [2021-12-22 00:12:43,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dcd98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:12:43, skipping insertion in model container [2021-12-22 00:12:43,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:43" (3/3) ... [2021-12-22 00:12:43,011 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2021-12-22 00:12:43,014 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:12:43,014 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-12-22 00:12:43,051 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:12:43,058 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 00:12:43,058 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-12-22 00:12:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 120 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:12:43,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:43,087 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:12:43,087 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 00:12:43,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:43,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899458005] [2021-12-22 00:12:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:43,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:43,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:43,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899458005] [2021-12-22 00:12:43,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899458005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:43,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:43,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:43,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866631687] [2021-12-22 00:12:43,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:43,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:43,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:43,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:43,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:43,255 INFO L87 Difference]: Start difference. First operand has 121 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 120 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:43,384 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-22 00:12:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:43,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:12:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:43,393 INFO L225 Difference]: With dead ends: 123 [2021-12-22 00:12:43,393 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 00:12:43,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:43,397 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:43,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 75 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 00:12:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-22 00:12:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 114 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2021-12-22 00:12:43,425 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 3 [2021-12-22 00:12:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:43,426 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2021-12-22 00:12:43,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2021-12-22 00:12:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:12:43,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:43,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:12:43,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 00:12:43,427 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 00:12:43,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:43,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240984758] [2021-12-22 00:12:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:43,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:43,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240984758] [2021-12-22 00:12:43,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240984758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:43,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:43,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:43,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465989455] [2021-12-22 00:12:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:43,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:43,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:43,459 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:43,526 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-22 00:12:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:43,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:12:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:43,531 INFO L225 Difference]: With dead ends: 133 [2021-12-22 00:12:43,531 INFO L226 Difference]: Without dead ends: 133 [2021-12-22 00:12:43,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:43,533 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:43,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 80 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-22 00:12:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2021-12-22 00:12:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2021-12-22 00:12:43,547 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 3 [2021-12-22 00:12:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:43,548 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2021-12-22 00:12:43,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2021-12-22 00:12:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 00:12:43,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:43,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:43,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 00:12:43,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-22 00:12:43,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:43,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999648344] [2021-12-22 00:12:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:43,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:43,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999648344] [2021-12-22 00:12:43,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999648344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:43,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:43,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:12:43,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663446963] [2021-12-22 00:12:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:43,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:43,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:43,612 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:43,705 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-12-22 00:12:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:43,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 00:12:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:43,707 INFO L225 Difference]: With dead ends: 125 [2021-12-22 00:12:43,707 INFO L226 Difference]: Without dead ends: 125 [2021-12-22 00:12:43,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:43,708 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 158 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:43,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 63 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-22 00:12:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2021-12-22 00:12:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2021-12-22 00:12:43,714 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 8 [2021-12-22 00:12:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:43,714 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2021-12-22 00:12:43,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2021-12-22 00:12:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 00:12:43,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:43,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:43,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 00:12:43,715 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-22 00:12:43,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:43,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888671748] [2021-12-22 00:12:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:43,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:43,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:43,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888671748] [2021-12-22 00:12:43,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888671748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:43,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:43,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:43,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426287451] [2021-12-22 00:12:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:43,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:43,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:43,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:43,824 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:44,008 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2021-12-22 00:12:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 00:12:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:44,009 INFO L225 Difference]: With dead ends: 145 [2021-12-22 00:12:44,009 INFO L226 Difference]: Without dead ends: 145 [2021-12-22 00:12:44,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:12:44,010 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 249 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:44,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 102 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-22 00:12:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2021-12-22 00:12:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-12-22 00:12:44,015 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 8 [2021-12-22 00:12:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:44,015 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-12-22 00:12:44,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-12-22 00:12:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 00:12:44,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:44,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:44,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 00:12:44,017 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1117785369, now seen corresponding path program 1 times [2021-12-22 00:12:44,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:44,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986053107] [2021-12-22 00:12:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:44,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:44,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:44,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986053107] [2021-12-22 00:12:44,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986053107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:44,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:44,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:12:44,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053891717] [2021-12-22 00:12:44,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:44,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:44,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:44,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:44,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:44,050 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:44,127 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2021-12-22 00:12:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:12:44,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 00:12:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:44,128 INFO L225 Difference]: With dead ends: 130 [2021-12-22 00:12:44,128 INFO L226 Difference]: Without dead ends: 130 [2021-12-22 00:12:44,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:44,129 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 111 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:44,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 133 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-22 00:12:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2021-12-22 00:12:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-12-22 00:12:44,133 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 10 [2021-12-22 00:12:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:44,133 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-12-22 00:12:44,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-12-22 00:12:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:12:44,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:44,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:44,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 00:12:44,135 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:44,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-22 00:12:44,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:44,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937043368] [2021-12-22 00:12:44,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:44,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:44,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937043368] [2021-12-22 00:12:44,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937043368] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:44,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:44,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:44,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163136728] [2021-12-22 00:12:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:44,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:44,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:44,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:44,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:44,177 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:44,300 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2021-12-22 00:12:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:12:44,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:12:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:44,302 INFO L225 Difference]: With dead ends: 116 [2021-12-22 00:12:44,302 INFO L226 Difference]: Without dead ends: 116 [2021-12-22 00:12:44,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:12:44,303 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:44,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 249 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-22 00:12:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-12-22 00:12:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 114 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-12-22 00:12:44,312 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 12 [2021-12-22 00:12:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:44,312 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-12-22 00:12:44,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-12-22 00:12:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:12:44,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:44,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:44,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 00:12:44,313 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:44,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-22 00:12:44,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:44,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358817181] [2021-12-22 00:12:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:44,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:44,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:44,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358817181] [2021-12-22 00:12:44,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358817181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:44,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:44,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:44,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257690295] [2021-12-22 00:12:44,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:44,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:44,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:44,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:44,383 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:44,546 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-12-22 00:12:44,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:12:44,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:12:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:44,547 INFO L225 Difference]: With dead ends: 117 [2021-12-22 00:12:44,547 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 00:12:44,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:12:44,548 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:44,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 284 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 00:12:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2021-12-22 00:12:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 109 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-12-22 00:12:44,553 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 12 [2021-12-22 00:12:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:44,553 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-12-22 00:12:44,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-12-22 00:12:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 00:12:44,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:44,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:44,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 00:12:44,555 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1066467192, now seen corresponding path program 1 times [2021-12-22 00:12:44,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:44,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586890613] [2021-12-22 00:12:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:44,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:44,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586890613] [2021-12-22 00:12:44,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586890613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:44,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:44,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 00:12:44,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851788082] [2021-12-22 00:12:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:44,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:44,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:44,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:44,622 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:44,747 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2021-12-22 00:12:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:12:44,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 00:12:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:44,750 INFO L225 Difference]: With dead ends: 167 [2021-12-22 00:12:44,751 INFO L226 Difference]: Without dead ends: 167 [2021-12-22 00:12:44,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:12:44,752 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 205 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:44,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 227 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-22 00:12:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2021-12-22 00:12:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.4) internal successors, (126), 116 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2021-12-22 00:12:44,764 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 13 [2021-12-22 00:12:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:44,764 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2021-12-22 00:12:44,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2021-12-22 00:12:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 00:12:44,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:44,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:44,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 00:12:44,766 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:44,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1434903386, now seen corresponding path program 1 times [2021-12-22 00:12:44,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879334088] [2021-12-22 00:12:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:44,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:44,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:44,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879334088] [2021-12-22 00:12:44,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879334088] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:44,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:44,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:44,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456485295] [2021-12-22 00:12:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:44,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:12:44,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:44,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:12:44,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:44,889 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:44,961 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2021-12-22 00:12:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:44,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 00:12:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:44,962 INFO L225 Difference]: With dead ends: 121 [2021-12-22 00:12:44,962 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 00:12:44,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:44,964 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:44,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 00:12:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2021-12-22 00:12:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-12-22 00:12:44,967 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 20 [2021-12-22 00:12:44,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:44,968 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-12-22 00:12:44,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-12-22 00:12:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 00:12:44,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:44,969 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:44,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 00:12:44,969 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1476921639, now seen corresponding path program 1 times [2021-12-22 00:12:44,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:44,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50470676] [2021-12-22 00:12:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:44,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:45,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50470676] [2021-12-22 00:12:45,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50470676] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141406923] [2021-12-22 00:12:45,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:45,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:45,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:45,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:12:45,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 00:12:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:45,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-22 00:12:45,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:45,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:45,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:45,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:12:45,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:12:45,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:12:45,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:12:45,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:45,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:45,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:45,347 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:45,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-22 00:12:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:45,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:45,671 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 21 treesize of output 19 [2021-12-22 00:12:45,673 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 17 [2021-12-22 00:12:45,677 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 23 treesize of output 21 [2021-12-22 00:12:45,684 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 22 treesize of output 20 [2021-12-22 00:12:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:45,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141406923] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:45,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:45,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-22 00:12:45,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137966680] [2021-12-22 00:12:45,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:45,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 00:12:45,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:45,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 00:12:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:12:45,701 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:45,894 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-12-22 00:12:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:12:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 00:12:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:45,896 INFO L225 Difference]: With dead ends: 143 [2021-12-22 00:12:45,896 INFO L226 Difference]: Without dead ends: 143 [2021-12-22 00:12:45,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-22 00:12:45,896 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 162 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:45,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 453 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2021-12-22 00:12:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-22 00:12:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2021-12-22 00:12:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2021-12-22 00:12:45,904 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2021-12-22 00:12:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:45,906 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2021-12-22 00:12:45,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2021-12-22 00:12:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 00:12:45,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:45,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:45,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:46,127 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,SelfDestructingSolverStorable9 [2021-12-22 00:12:46,127 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:46,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1060451530, now seen corresponding path program 1 times [2021-12-22 00:12:46,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:46,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245781061] [2021-12-22 00:12:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:46,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:46,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:46,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245781061] [2021-12-22 00:12:46,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245781061] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:46,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:46,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:46,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96950275] [2021-12-22 00:12:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:46,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:46,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:46,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:46,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:46,169 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:46,300 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2021-12-22 00:12:46,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:12:46,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 00:12:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:46,302 INFO L225 Difference]: With dead ends: 123 [2021-12-22 00:12:46,302 INFO L226 Difference]: Without dead ends: 123 [2021-12-22 00:12:46,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:12:46,302 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:46,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 246 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-22 00:12:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2021-12-22 00:12:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 121 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2021-12-22 00:12:46,305 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 21 [2021-12-22 00:12:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:46,305 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2021-12-22 00:12:46,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2021-12-22 00:12:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 00:12:46,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:46,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:46,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 00:12:46,319 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1060451529, now seen corresponding path program 1 times [2021-12-22 00:12:46,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:46,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565290706] [2021-12-22 00:12:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:46,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:46,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565290706] [2021-12-22 00:12:46,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565290706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:46,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:46,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:46,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801598629] [2021-12-22 00:12:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:46,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:46,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:46,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:46,416 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:46,579 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2021-12-22 00:12:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:12:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 00:12:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:46,580 INFO L225 Difference]: With dead ends: 120 [2021-12-22 00:12:46,580 INFO L226 Difference]: Without dead ends: 120 [2021-12-22 00:12:46,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:12:46,581 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 9 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:46,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 292 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-22 00:12:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2021-12-22 00:12:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-22 00:12:46,583 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 21 [2021-12-22 00:12:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:46,583 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-22 00:12:46,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-22 00:12:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 00:12:46,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:46,584 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:46,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 00:12:46,584 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash -794042809, now seen corresponding path program 1 times [2021-12-22 00:12:46,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:46,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748107971] [2021-12-22 00:12:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:46,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:46,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:46,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748107971] [2021-12-22 00:12:46,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748107971] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:46,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725568848] [2021-12-22 00:12:46,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:46,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:46,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:46,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:12:46,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 00:12:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:46,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-22 00:12:46,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:46,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:46,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 00:12:47,007 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:47,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 00:12:47,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:12:47,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:12:47,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:47,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 00:12:47,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:47,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:47,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:47,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:47,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:47,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:47,231 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:47,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_316 Int)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_316)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:47,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_7| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_57| Int) (v_ArrVal_316 Int)) (or (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_57| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_7|) 0)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_57| v_ArrVal_316)) |v_ULTIMATE.start_main_#t~malloc3#1.base_7| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))))) is different from false [2021-12-22 00:12:47,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:47,328 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:47,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2021-12-22 00:12:47,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-22 00:12:47,333 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 7 treesize of output 3 [2021-12-22 00:12:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:47,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725568848] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:47,357 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:47,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2021-12-22 00:12:47,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137086989] [2021-12-22 00:12:47,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:47,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-22 00:12:47,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-22 00:12:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=302, Unknown=5, NotChecked=200, Total=600 [2021-12-22 00:12:47,358 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:48,076 INFO L93 Difference]: Finished difference Result 254 states and 271 transitions. [2021-12-22 00:12:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 00:12:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 00:12:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:48,078 INFO L225 Difference]: With dead ends: 254 [2021-12-22 00:12:48,078 INFO L226 Difference]: Without dead ends: 254 [2021-12-22 00:12:48,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=658, Unknown=5, NotChecked=300, Total=1190 [2021-12-22 00:12:48,079 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 331 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:48,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 534 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 596 Invalid, 0 Unknown, 682 Unchecked, 0.4s Time] [2021-12-22 00:12:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-22 00:12:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 128. [2021-12-22 00:12:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 127 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2021-12-22 00:12:48,082 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 23 [2021-12-22 00:12:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:48,082 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2021-12-22 00:12:48,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2021-12-22 00:12:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 00:12:48,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:48,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,117 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-22 00:12:48,318 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,SelfDestructingSolverStorable12 [2021-12-22 00:12:48,318 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -136678670, now seen corresponding path program 1 times [2021-12-22 00:12:48,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:48,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850191874] [2021-12-22 00:12:48,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:12:48,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:48,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850191874] [2021-12-22 00:12:48,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850191874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:48,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:48,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:48,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456939653] [2021-12-22 00:12:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:48,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:48,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:48,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:48,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:48,338 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:48,359 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2021-12-22 00:12:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-22 00:12:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:48,360 INFO L225 Difference]: With dead ends: 130 [2021-12-22 00:12:48,360 INFO L226 Difference]: Without dead ends: 130 [2021-12-22 00:12:48,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:48,361 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:48,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:12:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-22 00:12:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-22 00:12:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.287037037037037) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2021-12-22 00:12:48,363 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 26 [2021-12-22 00:12:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:48,363 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2021-12-22 00:12:48,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2021-12-22 00:12:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 00:12:48,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:48,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 00:12:48,364 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1795791349, now seen corresponding path program 1 times [2021-12-22 00:12:48,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:48,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19998255] [2021-12-22 00:12:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:12:48,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:48,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19998255] [2021-12-22 00:12:48,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19998255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:48,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:48,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:12:48,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355179911] [2021-12-22 00:12:48,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:48,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:48,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:48,401 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:48,439 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2021-12-22 00:12:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:12:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-22 00:12:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:48,440 INFO L225 Difference]: With dead ends: 138 [2021-12-22 00:12:48,440 INFO L226 Difference]: Without dead ends: 138 [2021-12-22 00:12:48,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:48,441 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:48,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 211 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:12:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-22 00:12:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2021-12-22 00:12:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2021-12-22 00:12:48,443 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 28 [2021-12-22 00:12:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:48,444 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2021-12-22 00:12:48,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2021-12-22 00:12:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 00:12:48,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:48,444 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 00:12:48,445 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1776841875, now seen corresponding path program 1 times [2021-12-22 00:12:48,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:48,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022771901] [2021-12-22 00:12:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:48,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:48,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022771901] [2021-12-22 00:12:48,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022771901] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:48,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400697249] [2021-12-22 00:12:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:48,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:12:48,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 00:12:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-22 00:12:48,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:48,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:48,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:48,639 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-22 00:12:48,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:12:48,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:12:48,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:12:48,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:48,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:12:48,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:12:48,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400697249] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:48,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:48,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2021-12-22 00:12:48,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977169179] [2021-12-22 00:12:48,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:48,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:12:48,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:12:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:12:48,874 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:49,189 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2021-12-22 00:12:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 00:12:49,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-22 00:12:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:49,190 INFO L225 Difference]: With dead ends: 180 [2021-12-22 00:12:49,190 INFO L226 Difference]: Without dead ends: 180 [2021-12-22 00:12:49,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:12:49,191 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 78 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:49,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 387 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-22 00:12:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2021-12-22 00:12:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 143 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2021-12-22 00:12:49,194 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 29 [2021-12-22 00:12:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:49,194 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2021-12-22 00:12:49,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2021-12-22 00:12:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:12:49,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:49,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:49,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-22 00:12:49,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:49,403 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 752476291, now seen corresponding path program 1 times [2021-12-22 00:12:49,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606633111] [2021-12-22 00:12:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:49,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:12:49,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:49,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606633111] [2021-12-22 00:12:49,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606633111] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:49,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647487479] [2021-12-22 00:12:49,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:49,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:49,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:49,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:12:49,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 00:12:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:49,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 00:12:49,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:49,583 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 13 treesize of output 9 [2021-12-22 00:12:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:12:49,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 00:12:49,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647487479] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:49,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:49,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-22 00:12:49,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473085344] [2021-12-22 00:12:49,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:49,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:12:49,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:12:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:49,646 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:49,690 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2021-12-22 00:12:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:12:49,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-22 00:12:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:49,691 INFO L225 Difference]: With dead ends: 152 [2021-12-22 00:12:49,691 INFO L226 Difference]: Without dead ends: 129 [2021-12-22 00:12:49,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:49,692 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:49,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2021-12-22 00:12:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-22 00:12:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-22 00:12:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2021-12-22 00:12:49,694 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 30 [2021-12-22 00:12:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:49,694 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2021-12-22 00:12:49,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2021-12-22 00:12:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:12:49,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:49,695 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:49,714 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-22 00:12:49,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-22 00:12:49,911 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2041230200, now seen corresponding path program 1 times [2021-12-22 00:12:49,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:49,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706576071] [2021-12-22 00:12:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:49,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:50,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706576071] [2021-12-22 00:12:50,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706576071] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698267665] [2021-12-22 00:12:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:50,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:50,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:50,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:12:50,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 00:12:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:50,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-22 00:12:50,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:50,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:50,171 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-22 00:12:50,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-22 00:12:50,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:50,315 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:50,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-22 00:12:50,357 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:50,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-22 00:12:50,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:50,478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-22 00:12:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:50,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:50,767 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:50,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-22 00:12:50,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:50,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-22 00:12:50,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-22 00:12:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:51,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698267665] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:51,547 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:51,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-22 00:12:51,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107457842] [2021-12-22 00:12:51,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:51,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-22 00:12:51,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-22 00:12:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=734, Unknown=8, NotChecked=0, Total=870 [2021-12-22 00:12:51,548 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:51,860 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2021-12-22 00:12:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 00:12:51,860 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-22 00:12:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:51,861 INFO L225 Difference]: With dead ends: 149 [2021-12-22 00:12:51,861 INFO L226 Difference]: Without dead ends: 149 [2021-12-22 00:12:51,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=966, Unknown=8, NotChecked=0, Total=1190 [2021-12-22 00:12:51,862 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 130 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:51,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 637 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 538 Invalid, 0 Unknown, 480 Unchecked, 0.2s Time] [2021-12-22 00:12:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-22 00:12:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2021-12-22 00:12:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2021-12-22 00:12:51,864 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 30 [2021-12-22 00:12:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:51,864 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2021-12-22 00:12:51,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2021-12-22 00:12:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:12:51,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:51,865 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:51,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:52,075 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,SelfDestructingSolverStorable17 [2021-12-22 00:12:52,075 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2041230201, now seen corresponding path program 1 times [2021-12-22 00:12:52,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200455459] [2021-12-22 00:12:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:52,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:52,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:52,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200455459] [2021-12-22 00:12:52,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200455459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:52,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330717914] [2021-12-22 00:12:52,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:52,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:52,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:52,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 00:12:52,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 00:12:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:52,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-22 00:12:52,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:52,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:52,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:52,378 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:52,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 00:12:52,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:52,408 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:52,511 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 00:12:52,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-22 00:12:52,516 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-22 00:12:52,529 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:52,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-22 00:12:52,581 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:52,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-22 00:12:52,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-22 00:12:52,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:52,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:52,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:52,712 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:52,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-22 00:12:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:52,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:53,288 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2021-12-22 00:12:53,292 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:53,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2021-12-22 00:12:53,298 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:53,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2021-12-22 00:12:53,305 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:53,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 120 [2021-12-22 00:12:53,310 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 89 treesize of output 85 [2021-12-22 00:12:53,313 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 85 treesize of output 81 [2021-12-22 00:12:53,317 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 81 treesize of output 79 [2021-12-22 00:12:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:53,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330717914] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:53,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:53,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-12-22 00:12:53,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919348804] [2021-12-22 00:12:53,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:53,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-22 00:12:53,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-22 00:12:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=888, Unknown=8, NotChecked=0, Total=992 [2021-12-22 00:12:53,622 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:54,686 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2021-12-22 00:12:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-22 00:12:54,686 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-22 00:12:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:54,687 INFO L225 Difference]: With dead ends: 203 [2021-12-22 00:12:54,687 INFO L226 Difference]: Without dead ends: 203 [2021-12-22 00:12:54,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=347, Invalid=1997, Unknown=8, NotChecked=0, Total=2352 [2021-12-22 00:12:54,688 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 567 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:54,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 657 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 931 Invalid, 0 Unknown, 400 Unchecked, 0.4s Time] [2021-12-22 00:12:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-22 00:12:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 140. [2021-12-22 00:12:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 139 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2021-12-22 00:12:54,690 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 30 [2021-12-22 00:12:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:54,690 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2021-12-22 00:12:54,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.838709677419355) internal successors, (88), 32 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2021-12-22 00:12:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:12:54,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:54,691 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:54,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-22 00:12:54,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:54,908 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:54,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash -862773577, now seen corresponding path program 1 times [2021-12-22 00:12:54,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:54,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753696048] [2021-12-22 00:12:54,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:54,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:55,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:55,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753696048] [2021-12-22 00:12:55,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753696048] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:55,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447744907] [2021-12-22 00:12:55,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:55,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:55,166 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-22 00:12:55,167 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-22 00:12:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:55,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-22 00:12:55,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:55,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:55,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 00:12:55,321 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:55,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 00:12:55,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:12:55,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 00:12:55,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:55,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 00:12:55,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:55,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:55,490 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:55,490 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 11 treesize of output 11 [2021-12-22 00:12:55,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:55,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:55,555 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 16 treesize of output 8 [2021-12-22 00:12:55,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:55,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:55,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:55,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:55,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-22 00:12:55,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:55,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:55,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_692 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:55,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_692 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_11|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))) is different from false [2021-12-22 00:12:55,841 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:12:55,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-22 00:12:55,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_692 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_11| |c_ULTIMATE.start_main_~end~0#1.base|) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_682)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))))) is different from false [2021-12-22 00:12:55,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_17| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_682 Int) (v_ArrVal_692 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_11|) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81| v_ArrVal_682)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_81| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2021-12-22 00:12:55,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:55,968 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:55,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-22 00:12:55,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:55,971 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 36 treesize of output 24 [2021-12-22 00:12:55,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-22 00:12:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:55,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447744907] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:55,994 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:55,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 40 [2021-12-22 00:12:55,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046404088] [2021-12-22 00:12:55,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:55,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-22 00:12:55,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:55,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-22 00:12:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=895, Unknown=17, NotChecked=476, Total=1560 [2021-12-22 00:12:55,995 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:56,838 INFO L93 Difference]: Finished difference Result 368 states and 400 transitions. [2021-12-22 00:12:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 00:12:56,839 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-22 00:12:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:56,840 INFO L225 Difference]: With dead ends: 368 [2021-12-22 00:12:56,840 INFO L226 Difference]: Without dead ends: 368 [2021-12-22 00:12:56,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=397, Invalid=1870, Unknown=17, NotChecked=686, Total=2970 [2021-12-22 00:12:56,841 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 473 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1428 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:56,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 788 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 887 Invalid, 0 Unknown, 1428 Unchecked, 0.5s Time] [2021-12-22 00:12:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-12-22 00:12:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 155. [2021-12-22 00:12:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.263157894736842) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2021-12-22 00:12:56,849 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 30 [2021-12-22 00:12:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:56,849 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2021-12-22 00:12:56,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.925) internal successors, (77), 40 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2021-12-22 00:12:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 00:12:56,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:56,851 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:56,867 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-22 00:12:57,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:57,068 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:57,068 INFO L85 PathProgramCache]: Analyzing trace with hash 20301398, now seen corresponding path program 2 times [2021-12-22 00:12:57,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:57,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126244180] [2021-12-22 00:12:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:57,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:57,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:57,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126244180] [2021-12-22 00:12:57,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126244180] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:57,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114229356] [2021-12-22 00:12:57,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:12:57,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:57,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:57,424 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-22 00:12:57,428 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-22 00:12:57,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 00:12:57,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:12:57,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-22 00:12:57,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:57,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:57,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 00:12:57,605 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:57,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 00:12:57,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:57,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:12:57,648 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 21 treesize of output 20 [2021-12-22 00:12:57,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 00:12:57,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:57,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:57,765 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:57,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 00:12:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:57,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:57,819 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 16 treesize of output 8 [2021-12-22 00:12:57,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:57,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-22 00:12:57,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:57,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:12:57,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:57,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:57,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-22 00:12:57,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) is different from false [2021-12-22 00:12:58,116 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:12:58,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-22 00:12:58,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_804 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_20| Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_804)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_811) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_20|))) is different from false [2021-12-22 00:12:58,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_86| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_22| Int) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_804 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_20| Int)) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86| v_ArrVal_804)) |v_ULTIMATE.start_main_#t~malloc3#1.base_22| v_ArrVal_811) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_22|) 0)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_20|) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_86| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2021-12-22 00:12:58,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:58,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:58,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-22 00:12:58,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:58,243 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 36 treesize of output 24 [2021-12-22 00:12:58,245 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 7 treesize of output 3 [2021-12-22 00:12:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-22 00:12:58,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114229356] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:12:58,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:12:58,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 34 [2021-12-22 00:12:58,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498488493] [2021-12-22 00:12:58,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:12:58,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-22 00:12:58,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-22 00:12:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=610, Unknown=16, NotChecked=342, Total=1122 [2021-12-22 00:12:58,264 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:58,867 INFO L93 Difference]: Finished difference Result 394 states and 428 transitions. [2021-12-22 00:12:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-22 00:12:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-22 00:12:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:58,868 INFO L225 Difference]: With dead ends: 394 [2021-12-22 00:12:58,868 INFO L226 Difference]: Without dead ends: 394 [2021-12-22 00:12:58,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=394, Invalid=1506, Unknown=16, NotChecked=534, Total=2450 [2021-12-22 00:12:58,869 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 360 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1937 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:58,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 678 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 598 Invalid, 0 Unknown, 1937 Unchecked, 0.3s Time] [2021-12-22 00:12:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-12-22 00:12:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 163. [2021-12-22 00:12:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 162 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2021-12-22 00:12:58,872 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 33 [2021-12-22 00:12:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:58,872 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2021-12-22 00:12:58,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2021-12-22 00:12:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 00:12:58,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:58,873 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:58,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:59,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-22 00:12:59,082 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:12:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:59,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1167746943, now seen corresponding path program 1 times [2021-12-22 00:12:59,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:59,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472719884] [2021-12-22 00:12:59,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:59,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:59,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:59,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472719884] [2021-12-22 00:12:59,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472719884] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:12:59,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101543022] [2021-12-22 00:12:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:59,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:12:59,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:59,341 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-22 00:12:59,342 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-22 00:12:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:59,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-22 00:12:59,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:59,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:59,490 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:12:59,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 00:12:59,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:59,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:59,607 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:59,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-22 00:12:59,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:12:59,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-22 00:12:59,672 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:59,672 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 50 treesize of output 47 [2021-12-22 00:12:59,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-22 00:12:59,677 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 21 treesize of output 13 [2021-12-22 00:12:59,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:59,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:59,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:59,843 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:59,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2021-12-22 00:12:59,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:12:59,891 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:12:59,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-22 00:12:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:59,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:13:00,204 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 82 treesize of output 62 [2021-12-22 00:13:00,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (and (forall ((v_ArrVal_893 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) |c_ULTIMATE.start_main_~end~0#1.base|)) (= (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4) (+ .cse0 4))) (not (<= 0 .cse0)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_90| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_90|))))) is different from false [2021-12-22 00:13:00,556 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (not (<= 0 .cse0)) (let ((.cse1 (< |c_ULTIMATE.start_main_#t~mem4#1.offset| 0))) (and (or .cse1 (forall ((v_ArrVal_893 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|)))) (<= |c_ULTIMATE.start_main_#t~mem4#1.offset| .cse0) (or .cse1 (<= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_90| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_90|))))) is different from false [2021-12-22 00:13:00,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (< .cse0 0))) (and (<= .cse0 .cse1) (or .cse2 (<= .cse1 0)) (or (forall ((v_ArrVal_893 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) .cse3))) .cse2)))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_90| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 .cse1)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_90|))))) is different from false [2021-12-22 00:13:00,786 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:13:00,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2021-12-22 00:13:00,790 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:13:00,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2021-12-22 00:13:00,803 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:13:00,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 98 [2021-12-22 00:13:00,807 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 98 treesize of output 92 [2021-12-22 00:13:00,815 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:13:00,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 106 [2021-12-22 00:13:00,819 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 57 treesize of output 55 [2021-12-22 00:13:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:13:01,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101543022] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:13:01,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:13:01,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 38 [2021-12-22 00:13:01,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221787529] [2021-12-22 00:13:01,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:13:01,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-22 00:13:01,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:13:01,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-22 00:13:01,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1082, Unknown=4, NotChecked=204, Total=1406 [2021-12-22 00:13:01,202 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:13:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:13:01,973 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2021-12-22 00:13:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 00:13:01,973 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-22 00:13:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:13:01,974 INFO L225 Difference]: With dead ends: 170 [2021-12-22 00:13:01,974 INFO L226 Difference]: Without dead ends: 170 [2021-12-22 00:13:01,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=278, Invalid=1800, Unknown=4, NotChecked=270, Total=2352 [2021-12-22 00:13:01,975 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 108 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:13:01,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 910 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 795 Invalid, 0 Unknown, 487 Unchecked, 0.4s Time] [2021-12-22 00:13:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-22 00:13:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2021-12-22 00:13:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.25) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:13:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2021-12-22 00:13:01,977 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 35 [2021-12-22 00:13:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:13:01,977 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2021-12-22 00:13:01,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:13:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2021-12-22 00:13:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 00:13:01,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:13:01,978 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-22 00:13:01,995 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-22 00:13:02,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:13:02,178 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-22 00:13:02,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:13:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1209765196, now seen corresponding path program 2 times [2021-12-22 00:13:02,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:13:02,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828361845] [2021-12-22 00:13:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:13:02,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:13:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:13:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:13:02,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:13:02,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828361845] [2021-12-22 00:13:02,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828361845] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:13:02,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630880729] [2021-12-22 00:13:02,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:13:02,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:13:02,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:13:02,319 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-22 00:13:02,320 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-22 00:13:02,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 00:13:02,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:13:02,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-22 00:13:02,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:13:02,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:13:02,469 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:13:02,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-22 00:13:02,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:13:02,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:13:02,577 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-22 00:13:02,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2021-12-22 00:13:02,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:13:02,587 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-22 00:13:02,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-22 00:13:02,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:13:02,649 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-22 00:13:02,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2021-12-22 00:13:02,672 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-22 00:13:02,673 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2021-12-22 00:13:03,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:13:03,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:13:03,056 INFO L353 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-12-22 00:13:03,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 38 [2021-12-22 00:13:03,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:13:03,063 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:13:03,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-22 00:13:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:13:03,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:13:09,817 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:13:09,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 16172 treesize of output 14945 [2021-12-22 00:13:10,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:13:10,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:13:11,532 INFO L353 Elim1Store]: treesize reduction 624, result has 48.3 percent of original size [2021-12-22 00:13:11,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 92 case distinctions, treesize of input 2000873 treesize of output 1916530