./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.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 f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:32:42,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:32:42,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:32:42,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:32:42,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:32:42,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:32:42,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:32:42,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:32:42,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:32:42,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:32:42,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:32:42,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:32:42,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:32:42,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:32:42,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:32:42,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:32:42,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:32:42,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:32:42,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:32:42,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:32:42,655 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:32:42,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:32:42,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:32:42,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:32:42,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:32:42,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:32:42,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:32:42,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:32:42,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:32:42,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:32:42,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:32:42,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:32:42,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:32:42,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:32:42,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:32:42,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:32:42,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:32:42,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:32:42,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:32:42,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:32:42,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:32:42,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:32:42,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:32:42,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:32:42,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:32:42,690 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:32:42,690 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:32:42,691 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:32:42,694 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:32:42,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:32:42,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:32:42,694 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:32:42,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:32:42,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:32:42,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:32:42,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:32:42,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:32:42,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:32:42,696 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:32:42,696 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:32:42,696 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:32:42,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:32:42,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:32:42,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:32:42,697 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:32:42,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:32:42,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:32:42,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:32:42,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:32:42,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:32:42,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:32:42,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:32:42,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:32:42,699 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2022-07-12 18:32:42,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:32:42,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:32:42,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:32:42,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:32:42,908 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:32:42,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2022-07-12 18:32:42,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd551d90/27b18bab65cc45e382912979320388c7/FLAGcab35c6d4 [2022-07-12 18:32:43,331 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:32:43,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2022-07-12 18:32:43,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd551d90/27b18bab65cc45e382912979320388c7/FLAGcab35c6d4 [2022-07-12 18:32:43,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd551d90/27b18bab65cc45e382912979320388c7 [2022-07-12 18:32:43,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:32:43,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:32:43,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:32:43,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:32:43,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:32:43,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34891522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43, skipping insertion in model container [2022-07-12 18:32:43,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:32:43,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:32:43,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:32:43,640 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:32:43,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:32:43,700 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:32:43,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43 WrapperNode [2022-07-12 18:32:43,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:32:43,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:32:43,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:32:43,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:32:43,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,740 INFO L137 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-07-12 18:32:43,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:32:43,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:32:43,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:32:43,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:32:43,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:32:43,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:32:43,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:32:43,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:32:43,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (1/1) ... [2022-07-12 18:32:43,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:32:43,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:43,810 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) [2022-07-12 18:32:43,820 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 [2022-07-12 18:32:43,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:32:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:32:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:32:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:32:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:32:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:32:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:32:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:32:43,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:32:43,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:32:43,909 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:32:43,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:32:44,136 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:32:44,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:32:44,142 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:32:44,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:44 BoogieIcfgContainer [2022-07-12 18:32:44,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:32:44,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:32:44,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:32:44,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:32:44,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:32:43" (1/3) ... [2022-07-12 18:32:44,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4fab47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:32:44, skipping insertion in model container [2022-07-12 18:32:44,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:43" (2/3) ... [2022-07-12 18:32:44,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4fab47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:32:44, skipping insertion in model container [2022-07-12 18:32:44,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:44" (3/3) ... [2022-07-12 18:32:44,160 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2022-07-12 18:32:44,170 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:32:44,171 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-12 18:32:44,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:32:44,202 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7aa7a8c4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71a83de7 [2022-07-12 18:32:44,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-12 18:32:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:32:44,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:44,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:32:44,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2022-07-12 18:32:44,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:44,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436524641] [2022-07-12 18:32:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:44,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:44,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:44,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436524641] [2022-07-12 18:32:44,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436524641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:44,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:44,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:44,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107966786] [2022-07-12 18:32:44,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:44,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:32:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:44,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:32:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:32:44,335 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:44,347 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-07-12 18:32:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:32:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-12 18:32:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:44,354 INFO L225 Difference]: With dead ends: 64 [2022-07-12 18:32:44,354 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 18:32:44,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:32:44,357 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:44,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 18:32:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 18:32:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-07-12 18:32:44,380 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2022-07-12 18:32:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:44,380 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-07-12 18:32:44,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-07-12 18:32:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:32:44,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:44,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:44,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:32:44,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:44,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2022-07-12 18:32:44,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:44,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472281353] [2022-07-12 18:32:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:44,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472281353] [2022-07-12 18:32:44,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472281353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:44,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:44,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:32:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588751188] [2022-07-12 18:32:44,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:44,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:44,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:44,430 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:44,448 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-07-12 18:32:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:44,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-12 18:32:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:44,450 INFO L225 Difference]: With dead ends: 63 [2022-07-12 18:32:44,451 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 18:32:44,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:44,453 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:44,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 18:32:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-12 18:32:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-07-12 18:32:44,462 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2022-07-12 18:32:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:44,463 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-07-12 18:32:44,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-07-12 18:32:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:32:44,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:44,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:44,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:32:44,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:44,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2022-07-12 18:32:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:44,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078378008] [2022-07-12 18:32:44,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:44,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:44,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078378008] [2022-07-12 18:32:44,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078378008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:44,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:44,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461967460] [2022-07-12 18:32:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:44,508 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:44,534 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-07-12 18:32:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-12 18:32:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:44,535 INFO L225 Difference]: With dead ends: 111 [2022-07-12 18:32:44,535 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 18:32:44,536 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:32:44,536 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:44,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 18:32:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2022-07-12 18:32:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 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) [2022-07-12 18:32:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2022-07-12 18:32:44,552 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2022-07-12 18:32:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:44,552 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2022-07-12 18:32:44,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2022-07-12 18:32:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:32:44,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:44,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:44,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:32:44,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2022-07-12 18:32:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:44,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208449654] [2022-07-12 18:32:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:44,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208449654] [2022-07-12 18:32:44,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208449654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:44,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:44,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:32:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601594280] [2022-07-12 18:32:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:44,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:32:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:32:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:32:44,601 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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) [2022-07-12 18:32:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:44,633 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2022-07-12 18:32:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:32:44,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 [2022-07-12 18:32:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:44,634 INFO L225 Difference]: With dead ends: 101 [2022-07-12 18:32:44,634 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 18:32:44,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:32:44,635 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:44,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 215 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 18:32:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-07-12 18:32:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 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) [2022-07-12 18:32:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2022-07-12 18:32:44,640 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2022-07-12 18:32:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:44,640 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2022-07-12 18:32:44,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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) [2022-07-12 18:32:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2022-07-12 18:32:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:32:44,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:44,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:44,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:32:44,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2022-07-12 18:32:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:44,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021124028] [2022-07-12 18:32:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:44,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021124028] [2022-07-12 18:32:44,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021124028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:44,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:44,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278101490] [2022-07-12 18:32:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:44,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:44,681 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-12 18:32:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:44,724 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2022-07-12 18:32:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:44,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2022-07-12 18:32:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:44,726 INFO L225 Difference]: With dead ends: 177 [2022-07-12 18:32:44,726 INFO L226 Difference]: Without dead ends: 174 [2022-07-12 18:32:44,726 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:32:44,727 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:44,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-12 18:32:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2022-07-12 18:32:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2022-07-12 18:32:44,743 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 8 [2022-07-12 18:32:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:44,743 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2022-07-12 18:32:44,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-12 18:32:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-07-12 18:32:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:32:44,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:44,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:44,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:32:44,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2022-07-12 18:32:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:44,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759981781] [2022-07-12 18:32:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:44,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:44,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759981781] [2022-07-12 18:32:44,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759981781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:44,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:44,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287355267] [2022-07-12 18:32:44,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:44,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:44,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:44,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:44,769 INFO L87 Difference]: Start difference. First operand 153 states and 246 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-12 18:32:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:44,811 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2022-07-12 18:32:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:44,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2022-07-12 18:32:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:44,813 INFO L225 Difference]: With dead ends: 229 [2022-07-12 18:32:44,813 INFO L226 Difference]: Without dead ends: 229 [2022-07-12 18:32:44,815 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:32:44,816 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:44,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-12 18:32:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 208. [2022-07-12 18:32:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.7894736842105263) internal successors, (340), 207 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 340 transitions. [2022-07-12 18:32:44,827 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 340 transitions. Word has length 8 [2022-07-12 18:32:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:44,827 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 340 transitions. [2022-07-12 18:32:44,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-12 18:32:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2022-07-12 18:32:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:32:44,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:44,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:44,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:32:44,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2022-07-12 18:32:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:44,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314037242] [2022-07-12 18:32:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314037242] [2022-07-12 18:32:44,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314037242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:44,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:44,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228437652] [2022-07-12 18:32:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:44,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:44,860 INFO L87 Difference]: Start difference. First operand 208 states and 340 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-12 18:32:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:44,902 INFO L93 Difference]: Finished difference Result 224 states and 345 transitions. [2022-07-12 18:32:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2022-07-12 18:32:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:44,909 INFO L225 Difference]: With dead ends: 224 [2022-07-12 18:32:44,909 INFO L226 Difference]: Without dead ends: 224 [2022-07-12 18:32:44,909 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:32:44,910 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:44,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-12 18:32:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2022-07-12 18:32:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.7473684210526317) internal successors, (332), 205 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 332 transitions. [2022-07-12 18:32:44,933 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 332 transitions. Word has length 8 [2022-07-12 18:32:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:44,933 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 332 transitions. [2022-07-12 18:32:44,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-07-12 18:32:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 332 transitions. [2022-07-12 18:32:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 18:32:44,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:44,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:44,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:32:44,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:44,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2022-07-12 18:32:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:44,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973059082] [2022-07-12 18:32:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:44,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973059082] [2022-07-12 18:32:44,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973059082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:44,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:44,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:32:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439496015] [2022-07-12 18:32:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:44,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:32:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:44,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:32:44,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:32:44,964 INFO L87 Difference]: Start difference. First operand 206 states and 332 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:44,991 INFO L93 Difference]: Finished difference Result 265 states and 366 transitions. [2022-07-12 18:32:44,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:32:44,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-12 18:32:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:44,992 INFO L225 Difference]: With dead ends: 265 [2022-07-12 18:32:44,992 INFO L226 Difference]: Without dead ends: 265 [2022-07-12 18:32:44,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:32:44,993 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:44,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 279 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-12 18:32:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2022-07-12 18:32:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.6821192052980132) internal successors, (254), 162 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2022-07-12 18:32:44,998 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 9 [2022-07-12 18:32:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:44,998 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2022-07-12 18:32:44,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2022-07-12 18:32:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:32:44,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:45,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:45,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:32:45,007 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2022-07-12 18:32:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:45,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453515367] [2022-07-12 18:32:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:45,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453515367] [2022-07-12 18:32:45,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453515367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:45,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:45,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:32:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878004505] [2022-07-12 18:32:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:45,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:32:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:45,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:32:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:32:45,045 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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) [2022-07-12 18:32:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:45,068 INFO L93 Difference]: Finished difference Result 362 states and 528 transitions. [2022-07-12 18:32:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:32:45,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 [2022-07-12 18:32:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:45,070 INFO L225 Difference]: With dead ends: 362 [2022-07-12 18:32:45,070 INFO L226 Difference]: Without dead ends: 362 [2022-07-12 18:32:45,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:32:45,072 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:45,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 232 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-12 18:32:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 234. [2022-07-12 18:32:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 222 states have (on average 1.6036036036036037) internal successors, (356), 233 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2022-07-12 18:32:45,080 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 10 [2022-07-12 18:32:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:45,080 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2022-07-12 18:32:45,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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) [2022-07-12 18:32:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2022-07-12 18:32:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:32:45,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:45,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:45,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:32:45,082 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2022-07-12 18:32:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:45,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318162509] [2022-07-12 18:32:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318162509] [2022-07-12 18:32:45,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318162509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214297516] [2022-07-12 18:32:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:45,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:45,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:45,153 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) [2022-07-12 18:32:45,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 18:32:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:45,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:32:45,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:45,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:45,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214297516] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:45,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:45,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-12 18:32:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200223975] [2022-07-12 18:32:45,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:45,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:32:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:45,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:32:45,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:32:45,339 INFO L87 Difference]: Start difference. First operand 234 states and 356 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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) [2022-07-12 18:32:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:45,364 INFO L93 Difference]: Finished difference Result 238 states and 346 transitions. [2022-07-12 18:32:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:32:45,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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 16 [2022-07-12 18:32:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:45,365 INFO L225 Difference]: With dead ends: 238 [2022-07-12 18:32:45,365 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 18:32:45,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:32:45,366 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 142 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:45,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 338 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 18:32:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2022-07-12 18:32:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 218 states have (on average 1.5779816513761469) internal successors, (344), 229 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 344 transitions. [2022-07-12 18:32:45,372 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 344 transitions. Word has length 16 [2022-07-12 18:32:45,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:45,372 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 344 transitions. [2022-07-12 18:32:45,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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) [2022-07-12 18:32:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 344 transitions. [2022-07-12 18:32:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:32:45,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:45,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:45,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 18:32:45,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 18:32:45,574 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2022-07-12 18:32:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:45,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812047846] [2022-07-12 18:32:45,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:45,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:45,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812047846] [2022-07-12 18:32:45,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812047846] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:45,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126608927] [2022-07-12 18:32:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:45,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:45,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:45,607 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) [2022-07-12 18:32:45,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 18:32:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:45,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:32:45,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:45,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:45,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126608927] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:45,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:45,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-12 18:32:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541669583] [2022-07-12 18:32:45,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:45,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:32:45,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:45,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:32:45,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:32:45,747 INFO L87 Difference]: Start difference. First operand 230 states and 344 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:45,823 INFO L93 Difference]: Finished difference Result 525 states and 738 transitions. [2022-07-12 18:32:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:32:45,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:32:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:45,825 INFO L225 Difference]: With dead ends: 525 [2022-07-12 18:32:45,825 INFO L226 Difference]: Without dead ends: 525 [2022-07-12 18:32:45,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:32:45,826 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 243 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:45,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 510 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-12 18:32:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 323. [2022-07-12 18:32:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.5305466237942122) internal successors, (476), 322 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2022-07-12 18:32:45,832 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 16 [2022-07-12 18:32:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:45,832 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2022-07-12 18:32:45,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2022-07-12 18:32:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:32:45,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:45,836 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:45,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:46,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 18:32:46,041 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:46,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1134377974, now seen corresponding path program 2 times [2022-07-12 18:32:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:46,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913065114] [2022-07-12 18:32:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:32:46,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:46,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913065114] [2022-07-12 18:32:46,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913065114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:46,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064513271] [2022-07-12 18:32:46,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:32:46,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:46,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:46,092 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) [2022-07-12 18:32:46,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:32:46,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:32:46,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:32:46,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:32:46,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:46,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:46,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064513271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:46,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:46,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-07-12 18:32:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184359340] [2022-07-12 18:32:46,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:46,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:32:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:32:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:32:46,196 INFO L87 Difference]: Start difference. First operand 323 states and 476 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:46,277 INFO L93 Difference]: Finished difference Result 525 states and 726 transitions. [2022-07-12 18:32:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:32:46,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 18:32:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:46,279 INFO L225 Difference]: With dead ends: 525 [2022-07-12 18:32:46,279 INFO L226 Difference]: Without dead ends: 525 [2022-07-12 18:32:46,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:32:46,280 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 498 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:46,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 420 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-12 18:32:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 323. [2022-07-12 18:32:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.4919614147909968) internal successors, (464), 322 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 464 transitions. [2022-07-12 18:32:46,286 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 464 transitions. Word has length 22 [2022-07-12 18:32:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:46,286 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 464 transitions. [2022-07-12 18:32:46,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 464 transitions. [2022-07-12 18:32:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:32:46,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:46,287 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:46,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:46,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:46,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2022-07-12 18:32:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:46,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304499099] [2022-07-12 18:32:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304499099] [2022-07-12 18:32:46,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304499099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048549474] [2022-07-12 18:32:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:46,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:46,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:46,549 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) [2022-07-12 18:32:46,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:32:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:46,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:32:46,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:46,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:46,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048549474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:46,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:46,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-07-12 18:32:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526053678] [2022-07-12 18:32:46,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:46,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:32:46,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:46,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:32:46,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:32:46,676 INFO L87 Difference]: Start difference. First operand 323 states and 464 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:46,728 INFO L93 Difference]: Finished difference Result 932 states and 1332 transitions. [2022-07-12 18:32:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:32:46,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 18:32:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:46,732 INFO L225 Difference]: With dead ends: 932 [2022-07-12 18:32:46,732 INFO L226 Difference]: Without dead ends: 932 [2022-07-12 18:32:46,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:32:46,732 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 173 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:46,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 165 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-07-12 18:32:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 811. [2022-07-12 18:32:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 799 states have (on average 1.4793491864831039) internal successors, (1182), 810 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1182 transitions. [2022-07-12 18:32:46,744 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1182 transitions. Word has length 24 [2022-07-12 18:32:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:46,745 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1182 transitions. [2022-07-12 18:32:46,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1182 transitions. [2022-07-12 18:32:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:32:46,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:46,745 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:46,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:46,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:46,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2022-07-12 18:32:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:46,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231101795] [2022-07-12 18:32:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:47,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231101795] [2022-07-12 18:32:47,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231101795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:47,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002747577] [2022-07-12 18:32:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:47,008 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) [2022-07-12 18:32:47,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:32:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:47,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:32:47,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:47,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:47,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002747577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:47,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:47,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-12 18:32:47,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933945399] [2022-07-12 18:32:47,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:47,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:32:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:47,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:32:47,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:32:47,159 INFO L87 Difference]: Start difference. First operand 811 states and 1182 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 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) [2022-07-12 18:32:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:47,274 INFO L93 Difference]: Finished difference Result 2807 states and 3858 transitions. [2022-07-12 18:32:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:32:47,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 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 27 [2022-07-12 18:32:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:47,282 INFO L225 Difference]: With dead ends: 2807 [2022-07-12 18:32:47,282 INFO L226 Difference]: Without dead ends: 2807 [2022-07-12 18:32:47,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:32:47,282 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 693 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:47,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 493 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:32:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-07-12 18:32:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 1879. [2022-07-12 18:32:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1867 states have (on average 1.432244242099625) internal successors, (2674), 1878 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2674 transitions. [2022-07-12 18:32:47,311 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2674 transitions. Word has length 27 [2022-07-12 18:32:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:47,312 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 2674 transitions. [2022-07-12 18:32:47,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 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) [2022-07-12 18:32:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2674 transitions. [2022-07-12 18:32:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:32:47,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:47,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:47,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:47,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 18:32:47,528 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:47,528 INFO L85 PathProgramCache]: Analyzing trace with hash 554127938, now seen corresponding path program 1 times [2022-07-12 18:32:47,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:47,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282585574] [2022-07-12 18:32:47,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:47,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:32:47,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:47,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282585574] [2022-07-12 18:32:47,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282585574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:47,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008125232] [2022-07-12 18:32:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:47,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:47,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:47,568 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) [2022-07-12 18:32:47,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 18:32:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:47,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:32:47,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:32:47,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:32:47,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008125232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:47,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:47,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-12 18:32:47,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381368632] [2022-07-12 18:32:47,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:47,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:32:47,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:47,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:32:47,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:32:47,690 INFO L87 Difference]: Start difference. First operand 1879 states and 2674 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:47,737 INFO L93 Difference]: Finished difference Result 1558 states and 2125 transitions. [2022-07-12 18:32:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:32:47,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:32:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:47,741 INFO L225 Difference]: With dead ends: 1558 [2022-07-12 18:32:47,741 INFO L226 Difference]: Without dead ends: 1558 [2022-07-12 18:32:47,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:32:47,741 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 376 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:47,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 520 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2022-07-12 18:32:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 885. [2022-07-12 18:32:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 873 states have (on average 1.404352806414662) internal successors, (1226), 884 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1226 transitions. [2022-07-12 18:32:47,754 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1226 transitions. Word has length 27 [2022-07-12 18:32:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:47,754 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1226 transitions. [2022-07-12 18:32:47,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1226 transitions. [2022-07-12 18:32:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:32:47,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:47,755 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:47,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:47,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 18:32:47,961 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2022-07-12 18:32:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068502880] [2022-07-12 18:32:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 18:32:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068502880] [2022-07-12 18:32:48,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068502880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655248488] [2022-07-12 18:32:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:48,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:48,045 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) [2022-07-12 18:32:48,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 18:32:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:48,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:32:48,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:48,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:48,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655248488] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:48,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:48,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2022-07-12 18:32:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151318300] [2022-07-12 18:32:48,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:48,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:32:48,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:48,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:32:48,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:32:48,229 INFO L87 Difference]: Start difference. First operand 885 states and 1226 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:48,461 INFO L93 Difference]: Finished difference Result 2448 states and 3223 transitions. [2022-07-12 18:32:48,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 18:32:48,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 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 51 [2022-07-12 18:32:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:48,469 INFO L225 Difference]: With dead ends: 2448 [2022-07-12 18:32:48,469 INFO L226 Difference]: Without dead ends: 2448 [2022-07-12 18:32:48,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:32:48,470 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 955 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:48,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 1087 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:32:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-07-12 18:32:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 984. [2022-07-12 18:32:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 972 states have (on average 1.4207818930041152) internal successors, (1381), 983 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1381 transitions. [2022-07-12 18:32:48,489 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1381 transitions. Word has length 51 [2022-07-12 18:32:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:48,490 INFO L495 AbstractCegarLoop]: Abstraction has 984 states and 1381 transitions. [2022-07-12 18:32:48,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1381 transitions. [2022-07-12 18:32:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:32:48,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:48,492 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:48,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:48,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:48,701 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2022-07-12 18:32:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:48,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597470583] [2022-07-12 18:32:48,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-12 18:32:48,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:48,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597470583] [2022-07-12 18:32:48,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597470583] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:48,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797739038] [2022-07-12 18:32:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:48,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:48,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:48,772 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) [2022-07-12 18:32:48,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 18:32:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:48,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:32:48,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 18:32:48,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 18:32:48,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797739038] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:48,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:32:48,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2022-07-12 18:32:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798645069] [2022-07-12 18:32:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:48,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:32:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:32:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:32:48,922 INFO L87 Difference]: Start difference. First operand 984 states and 1381 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:48,999 INFO L93 Difference]: Finished difference Result 2310 states and 3137 transitions. [2022-07-12 18:32:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:32:49,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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 59 [2022-07-12 18:32:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:49,006 INFO L225 Difference]: With dead ends: 2310 [2022-07-12 18:32:49,007 INFO L226 Difference]: Without dead ends: 2310 [2022-07-12 18:32:49,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:32:49,008 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 225 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:49,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 500 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2022-07-12 18:32:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1632. [2022-07-12 18:32:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1620 states have (on average 1.3962962962962964) internal successors, (2262), 1631 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2262 transitions. [2022-07-12 18:32:49,035 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2262 transitions. Word has length 59 [2022-07-12 18:32:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:49,036 INFO L495 AbstractCegarLoop]: Abstraction has 1632 states and 2262 transitions. [2022-07-12 18:32:49,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2262 transitions. [2022-07-12 18:32:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:32:49,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:49,037 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:49,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:49,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 18:32:49,252 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:49,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2022-07-12 18:32:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:49,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871796665] [2022-07-12 18:32:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 18:32:49,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:49,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871796665] [2022-07-12 18:32:49,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871796665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:49,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24847677] [2022-07-12 18:32:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:49,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:49,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:49,292 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) [2022-07-12 18:32:49,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 18:32:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:49,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:32:49,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 18:32:49,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 18:32:49,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24847677] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:49,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:49,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2022-07-12 18:32:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210457644] [2022-07-12 18:32:49,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:49,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:32:49,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:49,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:32:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:32:49,436 INFO L87 Difference]: Start difference. First operand 1632 states and 2262 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:50,211 INFO L93 Difference]: Finished difference Result 9160 states and 12491 transitions. [2022-07-12 18:32:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 18:32:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 59 [2022-07-12 18:32:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:50,231 INFO L225 Difference]: With dead ends: 9160 [2022-07-12 18:32:50,232 INFO L226 Difference]: Without dead ends: 9160 [2022-07-12 18:32:50,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 18:32:50,233 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1336 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:50,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 820 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:32:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9160 states. [2022-07-12 18:32:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9160 to 4625. [2022-07-12 18:32:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 4614 states have (on average 1.4195925444299957) internal successors, (6550), 4624 states have internal predecessors, (6550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 6550 transitions. [2022-07-12 18:32:50,354 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 6550 transitions. Word has length 59 [2022-07-12 18:32:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:50,355 INFO L495 AbstractCegarLoop]: Abstraction has 4625 states and 6550 transitions. [2022-07-12 18:32:50,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 6550 transitions. [2022-07-12 18:32:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 18:32:50,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:50,356 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:50,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:50,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 18:32:50,567 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:50,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2022-07-12 18:32:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:50,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112453315] [2022-07-12 18:32:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-12 18:32:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:50,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112453315] [2022-07-12 18:32:50,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112453315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:50,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028354129] [2022-07-12 18:32:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:50,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:50,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:50,631 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) [2022-07-12 18:32:50,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 18:32:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:50,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:32:50,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 18:32:50,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 18:32:50,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028354129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:50,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:50,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2022-07-12 18:32:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739497696] [2022-07-12 18:32:50,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:50,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:32:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:32:50,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:32:50,803 INFO L87 Difference]: Start difference. First operand 4625 states and 6550 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:51,230 INFO L93 Difference]: Finished difference Result 10247 states and 14121 transitions. [2022-07-12 18:32:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 18:32:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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 63 [2022-07-12 18:32:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:51,262 INFO L225 Difference]: With dead ends: 10247 [2022-07-12 18:32:51,263 INFO L226 Difference]: Without dead ends: 10247 [2022-07-12 18:32:51,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 18:32:51,264 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 978 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:51,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1477 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:32:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2022-07-12 18:32:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 4425. [2022-07-12 18:32:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 4414 states have (on average 1.3948799275033983) internal successors, (6157), 4424 states have internal predecessors, (6157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 6157 transitions. [2022-07-12 18:32:51,332 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 6157 transitions. Word has length 63 [2022-07-12 18:32:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:51,333 INFO L495 AbstractCegarLoop]: Abstraction has 4425 states and 6157 transitions. [2022-07-12 18:32:51,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 6157 transitions. [2022-07-12 18:32:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 18:32:51,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:51,334 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:51,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:51,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:51,547 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2022-07-12 18:32:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785160042] [2022-07-12 18:32:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 18:32:51,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:32:51,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785160042] [2022-07-12 18:32:51,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785160042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:32:51,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264606042] [2022-07-12 18:32:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:51,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:51,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:51,607 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:32:51,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 18:32:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:51,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 18:32:51,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 18:32:51,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 18:32:51,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264606042] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:51,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:32:51,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-12 18:32:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477270079] [2022-07-12 18:32:51,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:51,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:32:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:32:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:32:51,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:32:51,815 INFO L87 Difference]: Start difference. First operand 4425 states and 6157 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:52,021 INFO L93 Difference]: Finished difference Result 3827 states and 5012 transitions. [2022-07-12 18:32:52,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:32:52,021 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 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 63 [2022-07-12 18:32:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:52,025 INFO L225 Difference]: With dead ends: 3827 [2022-07-12 18:32:52,025 INFO L226 Difference]: Without dead ends: 3827 [2022-07-12 18:32:52,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:32:52,026 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 957 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:52,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1487 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:32:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2022-07-12 18:32:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2865. [2022-07-12 18:32:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2854 states have (on average 1.3135949544498948) internal successors, (3749), 2864 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3749 transitions. [2022-07-12 18:32:52,073 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3749 transitions. Word has length 63 [2022-07-12 18:32:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:52,074 INFO L495 AbstractCegarLoop]: Abstraction has 2865 states and 3749 transitions. [2022-07-12 18:32:52,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3749 transitions. [2022-07-12 18:32:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 18:32:52,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:52,075 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:52,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:52,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:32:52,291 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2022-07-12 18:32:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:32:52,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12928279] [2022-07-12 18:32:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:32:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:32:52,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:32:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:32:52,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 18:32:52,338 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:32:52,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-07-12 18:32:52,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-07-12 18:32:52,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-07-12 18:32:52,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-07-12 18:32:52,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-07-12 18:32:52,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-07-12 18:32:52,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-07-12 18:32:52,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-07-12 18:32:52,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-07-12 18:32:52,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-07-12 18:32:52,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-07-12 18:32:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-07-12 18:32:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-07-12 18:32:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-07-12 18:32:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-07-12 18:32:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-07-12 18:32:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-07-12 18:32:52,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-07-12 18:32:52,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-07-12 18:32:52,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-07-12 18:32:52,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 18:32:52,344 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:52,346 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:32:52,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:32:52 BoogieIcfgContainer [2022-07-12 18:32:52,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:32:52,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:32:52,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:32:52,403 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:32:52,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:44" (3/4) ... [2022-07-12 18:32:52,405 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 18:32:52,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:32:52,406 INFO L158 Benchmark]: Toolchain (without parser) took 9054.98ms. Allocated memory was 102.8MB in the beginning and 209.7MB in the end (delta: 107.0MB). Free memory was 75.0MB in the beginning and 96.0MB in the end (delta: -21.0MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2022-07-12 18:32:52,406 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:32:52,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.25ms. Allocated memory is still 102.8MB. Free memory was 74.8MB in the beginning and 69.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 18:32:52,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.73ms. Allocated memory is still 102.8MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:32:52,407 INFO L158 Benchmark]: Boogie Preprocessor took 25.80ms. Allocated memory is still 102.8MB. Free memory was 67.8MB in the beginning and 66.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:32:52,407 INFO L158 Benchmark]: RCFGBuilder took 377.75ms. Allocated memory was 102.8MB in the beginning and 140.5MB in the end (delta: 37.7MB). Free memory was 66.1MB in the beginning and 115.1MB in the end (delta: -49.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2022-07-12 18:32:52,410 INFO L158 Benchmark]: TraceAbstraction took 8255.43ms. Allocated memory was 140.5MB in the beginning and 209.7MB in the end (delta: 69.2MB). Free memory was 114.6MB in the beginning and 97.1MB in the end (delta: 17.5MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2022-07-12 18:32:52,410 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 209.7MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:32:52,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.25ms. Allocated memory is still 102.8MB. Free memory was 74.8MB in the beginning and 69.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.73ms. Allocated memory is still 102.8MB. Free memory was 69.9MB in the beginning and 67.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.80ms. Allocated memory is still 102.8MB. Free memory was 67.8MB in the beginning and 66.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 377.75ms. Allocated memory was 102.8MB in the beginning and 140.5MB in the end (delta: 37.7MB). Free memory was 66.1MB in the beginning and 115.1MB in the end (delta: -49.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8255.43ms. Allocated memory was 140.5MB in the beginning and 209.7MB in the end (delta: 69.2MB). Free memory was 114.6MB in the beginning and 97.1MB in the end (delta: 17.5MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 209.7MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-2:0}, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7052 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7052 mSDsluCounter, 9385 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7024 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1996 IncrementalHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 2361 mSDtfsCounter, 1996 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1120 GetRequests, 878 SyntacticMatches, 15 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4625occurred in iteration=18, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 15909 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1309 ConstructedInterpolants, 0 QuantifiedInterpolants, 3196 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2051 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 42 InterpolantComputations, 10 PerfectInterpolantSequences, 1487/1857 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 18:32:52,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:32:54,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:32:54,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:32:54,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:32:54,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:32:54,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:32:54,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:32:54,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:32:54,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:32:54,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:32:54,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:32:54,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:32:54,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:32:54,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:32:54,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:32:54,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:32:54,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:32:54,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:32:54,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:32:54,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:32:54,158 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:32:54,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:32:54,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:32:54,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:32:54,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:32:54,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:32:54,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:32:54,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:32:54,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:32:54,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:32:54,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:32:54,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:32:54,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:32:54,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:32:54,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:32:54,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:32:54,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:32:54,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:32:54,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:32:54,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:32:54,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:32:54,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:32:54,179 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:32:54,207 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:32:54,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:32:54,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:32:54,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:32:54,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:32:54,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:32:54,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:32:54,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:32:54,215 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:32:54,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:32:54,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:32:54,216 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:32:54,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:32:54,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:32:54,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:32:54,217 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:32:54,217 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:32:54,217 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:32:54,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:32:54,217 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:32:54,217 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:32:54,218 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:32:54,218 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:32:54,218 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:32:54,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:32:54,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:32:54,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:32:54,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:32:54,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:32:54,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:32:54,219 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:32:54,220 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:32:54,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:32:54,220 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2022-07-12 18:32:54,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:32:54,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:32:54,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:32:54,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:32:54,502 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:32:54,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2022-07-12 18:32:54,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52ce6b3ed/4052a4b854244131964d9474954e9b80/FLAGce4e91a21 [2022-07-12 18:32:55,014 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:32:55,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2022-07-12 18:32:55,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52ce6b3ed/4052a4b854244131964d9474954e9b80/FLAGce4e91a21 [2022-07-12 18:32:55,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52ce6b3ed/4052a4b854244131964d9474954e9b80 [2022-07-12 18:32:55,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:32:55,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:32:55,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:32:55,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:32:55,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:32:55,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b3e1c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55, skipping insertion in model container [2022-07-12 18:32:55,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:32:55,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:32:55,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:32:55,651 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:32:55,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:32:55,729 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:32:55,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55 WrapperNode [2022-07-12 18:32:55,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:32:55,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:32:55,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:32:55,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:32:55,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,777 INFO L137 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-12 18:32:55,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:32:55,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:32:55,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:32:55,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:32:55,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:32:55,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:32:55,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:32:55,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:32:55,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (1/1) ... [2022-07-12 18:32:55,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:32:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:32:55,855 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) [2022-07-12 18:32:55,864 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 [2022-07-12 18:32:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:32:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:32:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:32:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:32:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:32:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:32:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:32:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 18:32:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:32:55,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:32:56,040 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:32:56,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:32:56,320 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:32:56,330 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:32:56,330 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:32:56,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:56 BoogieIcfgContainer [2022-07-12 18:32:56,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:32:56,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:32:56,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:32:56,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:32:56,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:32:55" (1/3) ... [2022-07-12 18:32:56,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486a860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:32:56, skipping insertion in model container [2022-07-12 18:32:56,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:32:55" (2/3) ... [2022-07-12 18:32:56,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486a860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:32:56, skipping insertion in model container [2022-07-12 18:32:56,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:56" (3/3) ... [2022-07-12 18:32:56,336 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2022-07-12 18:32:56,345 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:32:56,345 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-12 18:32:56,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:32:56,389 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30f12948, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cb370d [2022-07-12 18:32:56,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-12 18:32:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:32:56,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:56,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:32:56,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2022-07-12 18:32:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:56,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808914786] [2022-07-12 18:32:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:56,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:56,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:56,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:32:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:56,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:32:56,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:56,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:32:56,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:56,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808914786] [2022-07-12 18:32:56,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808914786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:56,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:56,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:56,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020430969] [2022-07-12 18:32:56,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:56,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:56,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:56,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:56,563 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:56,626 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-07-12 18:32:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:56,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-12 18:32:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:56,639 INFO L225 Difference]: With dead ends: 107 [2022-07-12 18:32:56,639 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 18:32:56,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:56,643 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:56,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 18:32:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-07-12 18:32:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-07-12 18:32:56,678 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2022-07-12 18:32:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:56,679 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-07-12 18:32:56,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-07-12 18:32:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:32:56,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:56,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:32:56,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 18:32:56,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:56,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:56,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:56,887 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2022-07-12 18:32:56,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:56,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411387174] [2022-07-12 18:32:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:56,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:56,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:56,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:56,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:32:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:56,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:32:56,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:56,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:32:56,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:56,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411387174] [2022-07-12 18:32:56,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411387174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:56,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:56,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:56,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424823249] [2022-07-12 18:32:56,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:56,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:56,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:56,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:56,946 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:57,043 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2022-07-12 18:32:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:32:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:57,049 INFO L225 Difference]: With dead ends: 163 [2022-07-12 18:32:57,049 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 18:32:57,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:57,050 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:57,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:32:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 18:32:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2022-07-12 18:32:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2022-07-12 18:32:57,058 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2022-07-12 18:32:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:57,058 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2022-07-12 18:32:57,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2022-07-12 18:32:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:32:57,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:57,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:32:57,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:57,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:57,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2022-07-12 18:32:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:57,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902640961] [2022-07-12 18:32:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:57,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:57,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:57,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:57,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:32:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:57,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:32:57,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:57,325 INFO L390 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 [2022-07-12 18:32:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:57,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:32:57,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:57,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902640961] [2022-07-12 18:32:57,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902640961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:57,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:57,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:57,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509476981] [2022-07-12 18:32:57,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:57,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:57,333 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:57,444 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2022-07-12 18:32:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:32:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:57,446 INFO L225 Difference]: With dead ends: 211 [2022-07-12 18:32:57,446 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 18:32:57,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:57,447 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:57,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:32:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 18:32:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2022-07-12 18:32:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2022-07-12 18:32:57,458 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2022-07-12 18:32:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:57,458 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2022-07-12 18:32:57,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2022-07-12 18:32:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:32:57,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:57,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:32:57,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 18:32:57,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:57,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2022-07-12 18:32:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104991879] [2022-07-12 18:32:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:57,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:57,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:57,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:57,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:32:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:57,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:32:57,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:57,728 INFO L390 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 [2022-07-12 18:32:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:57,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:32:57,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:57,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104991879] [2022-07-12 18:32:57,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104991879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:57,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:57,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:32:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48182723] [2022-07-12 18:32:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:57,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:32:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:32:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:57,735 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:57,827 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2022-07-12 18:32:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:32:57,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:32:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:57,836 INFO L225 Difference]: With dead ends: 206 [2022-07-12 18:32:57,836 INFO L226 Difference]: Without dead ends: 206 [2022-07-12 18:32:57,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:32:57,837 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:57,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:32:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-12 18:32:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2022-07-12 18:32:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2022-07-12 18:32:57,845 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2022-07-12 18:32:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:57,845 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2022-07-12 18:32:57,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2022-07-12 18:32:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:32:57,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:57,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:57,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:58,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:58,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2022-07-12 18:32:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:58,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542455169] [2022-07-12 18:32:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:58,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:58,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:58,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:58,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:32:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:58,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:32:58,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:58,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:32:58,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:58,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542455169] [2022-07-12 18:32:58,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542455169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:58,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:58,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:32:58,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369102819] [2022-07-12 18:32:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:58,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:32:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:58,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:32:58,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:32:58,107 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:58,141 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2022-07-12 18:32:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:32:58,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-12 18:32:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:58,143 INFO L225 Difference]: With dead ends: 211 [2022-07-12 18:32:58,143 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 18:32:58,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:32:58,144 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:58,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 18:32:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2022-07-12 18:32:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2022-07-12 18:32:58,149 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2022-07-12 18:32:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:58,149 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2022-07-12 18:32:58,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2022-07-12 18:32:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:32:58,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:58,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:58,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:58,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:58,358 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2022-07-12 18:32:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:58,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363531793] [2022-07-12 18:32:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:58,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:58,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:58,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:58,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:32:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:58,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:32:58,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:58,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:32:58,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:58,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363531793] [2022-07-12 18:32:58,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363531793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:32:58,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:32:58,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:32:58,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632002246] [2022-07-12 18:32:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:32:58,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:32:58,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:58,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:32:58,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:32:58,435 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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) [2022-07-12 18:32:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:58,463 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2022-07-12 18:32:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:32:58,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 [2022-07-12 18:32:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:58,465 INFO L225 Difference]: With dead ends: 283 [2022-07-12 18:32:58,465 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 18:32:58,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:32:58,467 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:58,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 18:32:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2022-07-12 18:32:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2022-07-12 18:32:58,486 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2022-07-12 18:32:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:58,486 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2022-07-12 18:32:58,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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) [2022-07-12 18:32:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2022-07-12 18:32:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:32:58,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:58,487 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:58,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:58,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:58,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:58,699 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2022-07-12 18:32:58,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:58,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742570847] [2022-07-12 18:32:58,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:58,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:58,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:58,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:58,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:32:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:58,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:32:58,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:58,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:58,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:58,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742570847] [2022-07-12 18:32:58,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742570847] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:58,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:32:58,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-12 18:32:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496167169] [2022-07-12 18:32:58,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:58,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:32:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:58,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:32:58,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:32:58,810 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2022-07-12 18:32:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:58,896 INFO L93 Difference]: Finished difference Result 461 states and 690 transitions. [2022-07-12 18:32:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:32:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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 [2022-07-12 18:32:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:58,900 INFO L225 Difference]: With dead ends: 461 [2022-07-12 18:32:58,900 INFO L226 Difference]: Without dead ends: 461 [2022-07-12 18:32:58,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:32:58,901 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:58,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 471 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:32:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-12 18:32:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 258. [2022-07-12 18:32:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2022-07-12 18:32:58,908 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 12 [2022-07-12 18:32:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:58,909 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2022-07-12 18:32:58,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2022-07-12 18:32:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2022-07-12 18:32:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:32:58,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:58,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:58,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:59,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:59,116 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2022-07-12 18:32:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:59,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976465147] [2022-07-12 18:32:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:59,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:59,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:59,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:32:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:59,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:32:59,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:59,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:59,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:59,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976465147] [2022-07-12 18:32:59,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976465147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:59,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:32:59,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2022-07-12 18:32:59,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947722201] [2022-07-12 18:32:59,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:59,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:32:59,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:32:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:32:59,232 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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) [2022-07-12 18:32:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:59,284 INFO L93 Difference]: Finished difference Result 600 states and 886 transitions. [2022-07-12 18:32:59,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:32:59,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 12 [2022-07-12 18:32:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:59,286 INFO L225 Difference]: With dead ends: 600 [2022-07-12 18:32:59,286 INFO L226 Difference]: Without dead ends: 600 [2022-07-12 18:32:59,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:32:59,286 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 214 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:59,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 343 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-07-12 18:32:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 576. [2022-07-12 18:32:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 1.570921985815603) internal successors, (886), 575 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 886 transitions. [2022-07-12 18:32:59,302 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 886 transitions. Word has length 12 [2022-07-12 18:32:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:59,302 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 886 transitions. [2022-07-12 18:32:59,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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) [2022-07-12 18:32:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 886 transitions. [2022-07-12 18:32:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:32:59,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:59,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:59,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:59,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:59,504 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1582579647, now seen corresponding path program 2 times [2022-07-12 18:32:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:59,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338313880] [2022-07-12 18:32:59,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:32:59,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:59,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:59,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:59,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:32:59,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:32:59,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:32:59,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:32:59,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:59,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:32:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:59,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:32:59,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338313880] [2022-07-12 18:32:59,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338313880] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:32:59,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:32:59,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 18:32:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469799655] [2022-07-12 18:32:59,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:32:59,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:32:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:32:59,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:32:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:32:59,594 INFO L87 Difference]: Start difference. First operand 576 states and 886 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:32:59,661 INFO L93 Difference]: Finished difference Result 998 states and 1530 transitions. [2022-07-12 18:32:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:32:59,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:32:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:32:59,664 INFO L225 Difference]: With dead ends: 998 [2022-07-12 18:32:59,664 INFO L226 Difference]: Without dead ends: 998 [2022-07-12 18:32:59,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:32:59,665 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 192 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:32:59,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 336 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:32:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-07-12 18:32:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 968. [2022-07-12 18:32:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 956 states have (on average 1.5502092050209204) internal successors, (1482), 967 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1482 transitions. [2022-07-12 18:32:59,678 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1482 transitions. Word has length 16 [2022-07-12 18:32:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:32:59,678 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1482 transitions. [2022-07-12 18:32:59,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:32:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1482 transitions. [2022-07-12 18:32:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:32:59,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:32:59,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:32:59,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:32:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:32:59,886 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:32:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:32:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2022-07-12 18:32:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:32:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188004731] [2022-07-12 18:32:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:32:59,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:32:59,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:32:59,888 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:32:59,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:32:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:32:59,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:32:59,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:32:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:32:59,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:00,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:00,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188004731] [2022-07-12 18:33:00,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188004731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:00,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:00,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-12 18:33:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003060945] [2022-07-12 18:33:00,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:00,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:00,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:00,015 INFO L87 Difference]: Start difference. First operand 968 states and 1482 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:00,063 INFO L93 Difference]: Finished difference Result 1243 states and 1844 transitions. [2022-07-12 18:33:00,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:33:00,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-07-12 18:33:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:00,067 INFO L225 Difference]: With dead ends: 1243 [2022-07-12 18:33:00,067 INFO L226 Difference]: Without dead ends: 1243 [2022-07-12 18:33:00,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:33:00,067 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:00,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 192 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-07-12 18:33:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1100. [2022-07-12 18:33:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1088 states have (on average 1.5110294117647058) internal successors, (1644), 1099 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1644 transitions. [2022-07-12 18:33:00,082 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1644 transitions. Word has length 18 [2022-07-12 18:33:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:00,082 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1644 transitions. [2022-07-12 18:33:00,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1644 transitions. [2022-07-12 18:33:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:33:00,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:00,083 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:00,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:00,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:00,289 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2022-07-12 18:33:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:00,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155113046] [2022-07-12 18:33:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:00,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:00,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:00,291 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:00,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:33:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:00,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:33:00,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:00,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:00,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:00,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155113046] [2022-07-12 18:33:00,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155113046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:00,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:00,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-12 18:33:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225896954] [2022-07-12 18:33:00,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:00,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:33:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:00,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:33:00,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:33:00,390 INFO L87 Difference]: Start difference. First operand 1100 states and 1644 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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) [2022-07-12 18:33:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:00,458 INFO L93 Difference]: Finished difference Result 1384 states and 1990 transitions. [2022-07-12 18:33:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:33:00,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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 [2022-07-12 18:33:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:00,462 INFO L225 Difference]: With dead ends: 1384 [2022-07-12 18:33:00,462 INFO L226 Difference]: Without dead ends: 1384 [2022-07-12 18:33:00,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:33:00,462 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 201 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:00,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 539 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-07-12 18:33:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1009. [2022-07-12 18:33:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 997 states have (on average 1.4794383149448345) internal successors, (1475), 1008 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1475 transitions. [2022-07-12 18:33:00,476 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1475 transitions. Word has length 21 [2022-07-12 18:33:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:00,476 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1475 transitions. [2022-07-12 18:33:00,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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) [2022-07-12 18:33:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1475 transitions. [2022-07-12 18:33:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:33:00,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:00,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:00,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:00,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:00,688 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2034622781, now seen corresponding path program 2 times [2022-07-12 18:33:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:00,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78212999] [2022-07-12 18:33:00,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:33:00,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:00,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:00,692 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:00,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:33:00,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:33:00,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:33:00,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:33:00,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:33:00,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:33:00,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:00,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78212999] [2022-07-12 18:33:00,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78212999] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:00,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:00,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 18:33:00,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634889507] [2022-07-12 18:33:00,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:00,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:33:00,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:00,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:33:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:00,813 INFO L87 Difference]: Start difference. First operand 1009 states and 1475 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:00,867 INFO L93 Difference]: Finished difference Result 994 states and 1410 transitions. [2022-07-12 18:33:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:33:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:00,870 INFO L225 Difference]: With dead ends: 994 [2022-07-12 18:33:00,870 INFO L226 Difference]: Without dead ends: 994 [2022-07-12 18:33:00,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:33:00,871 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 172 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:00,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 522 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-07-12 18:33:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2022-07-12 18:33:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 958 states have (on average 1.4718162839248434) internal successors, (1410), 969 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1410 transitions. [2022-07-12 18:33:00,892 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1410 transitions. Word has length 27 [2022-07-12 18:33:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:00,892 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1410 transitions. [2022-07-12 18:33:00,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1410 transitions. [2022-07-12 18:33:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:33:00,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:00,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:00,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:01,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:01,103 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1432941687, now seen corresponding path program 1 times [2022-07-12 18:33:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:01,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882526992] [2022-07-12 18:33:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:01,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:01,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:01,105 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:01,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:33:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:01,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:33:01,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:01,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:01,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882526992] [2022-07-12 18:33:01,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882526992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:01,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:01,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-12 18:33:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596335407] [2022-07-12 18:33:01,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:01,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:33:01,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:33:01,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:01,247 INFO L87 Difference]: Start difference. First operand 970 states and 1410 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:01,317 INFO L93 Difference]: Finished difference Result 1049 states and 1452 transitions. [2022-07-12 18:33:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:33:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:33:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:01,320 INFO L225 Difference]: With dead ends: 1049 [2022-07-12 18:33:01,320 INFO L226 Difference]: Without dead ends: 1049 [2022-07-12 18:33:01,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:33:01,321 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 233 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:01,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 808 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-07-12 18:33:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 892. [2022-07-12 18:33:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 880 states have (on average 1.4397727272727272) internal successors, (1267), 891 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1267 transitions. [2022-07-12 18:33:01,332 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1267 transitions. Word has length 27 [2022-07-12 18:33:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:01,333 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1267 transitions. [2022-07-12 18:33:01,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1267 transitions. [2022-07-12 18:33:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:33:01,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:01,333 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:01,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:01,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:01,543 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1945741357, now seen corresponding path program 1 times [2022-07-12 18:33:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:01,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262204711] [2022-07-12 18:33:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:01,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:01,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:01,545 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:01,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:33:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:01,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:33:01,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:01,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:01,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:01,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262204711] [2022-07-12 18:33:01,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262204711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:01,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:01,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2022-07-12 18:33:01,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667101290] [2022-07-12 18:33:01,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:01,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:33:01,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:33:01,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:33:01,886 INFO L87 Difference]: Start difference. First operand 892 states and 1267 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:02,283 INFO L93 Difference]: Finished difference Result 1882 states and 2629 transitions. [2022-07-12 18:33:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:33:02,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 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 [2022-07-12 18:33:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:02,292 INFO L225 Difference]: With dead ends: 1882 [2022-07-12 18:33:02,293 INFO L226 Difference]: Without dead ends: 1882 [2022-07-12 18:33:02,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:33:02,293 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 646 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:02,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1500 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-12 18:33:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1834. [2022-07-12 18:33:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1822 states have (on average 1.442919868276619) internal successors, (2629), 1833 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2629 transitions. [2022-07-12 18:33:02,325 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2629 transitions. Word has length 30 [2022-07-12 18:33:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:02,325 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 2629 transitions. [2022-07-12 18:33:02,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2629 transitions. [2022-07-12 18:33:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:33:02,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:02,327 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:02,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:02,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:02,535 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1575281728, now seen corresponding path program 1 times [2022-07-12 18:33:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352745832] [2022-07-12 18:33:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:02,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:02,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:02,537 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:02,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 18:33:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:02,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:33:02,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:02,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:02,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:02,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352745832] [2022-07-12 18:33:02,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352745832] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:02,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:02,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-12 18:33:02,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432104267] [2022-07-12 18:33:02,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:02,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:33:02,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:02,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:33:02,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:02,682 INFO L87 Difference]: Start difference. First operand 1834 states and 2629 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:02,797 INFO L93 Difference]: Finished difference Result 2281 states and 3205 transitions. [2022-07-12 18:33:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:33:02,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 [2022-07-12 18:33:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:02,803 INFO L225 Difference]: With dead ends: 2281 [2022-07-12 18:33:02,803 INFO L226 Difference]: Without dead ends: 2281 [2022-07-12 18:33:02,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:33:02,805 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 274 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:02,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1139 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2022-07-12 18:33:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1782. [2022-07-12 18:33:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1770 states have (on average 1.426553672316384) internal successors, (2525), 1781 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2525 transitions. [2022-07-12 18:33:02,832 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2525 transitions. Word has length 33 [2022-07-12 18:33:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:02,833 INFO L495 AbstractCegarLoop]: Abstraction has 1782 states and 2525 transitions. [2022-07-12 18:33:02,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2525 transitions. [2022-07-12 18:33:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:33:02,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:02,834 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:02,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-12 18:33:03,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:03,040 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2022-07-12 18:33:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060843238] [2022-07-12 18:33:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:03,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:03,042 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:03,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 18:33:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:03,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:33:03,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:03,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:03,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:03,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060843238] [2022-07-12 18:33:03,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060843238] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:03,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:03,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-12 18:33:03,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292781131] [2022-07-12 18:33:03,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:03,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:33:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:03,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:33:03,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:33:03,244 INFO L87 Difference]: Start difference. First operand 1782 states and 2525 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:03,388 INFO L93 Difference]: Finished difference Result 2267 states and 3153 transitions. [2022-07-12 18:33:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:33:03,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-07-12 18:33:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:03,394 INFO L225 Difference]: With dead ends: 2267 [2022-07-12 18:33:03,395 INFO L226 Difference]: Without dead ends: 2267 [2022-07-12 18:33:03,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:33:03,395 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 340 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:03,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1561 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-07-12 18:33:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1756. [2022-07-12 18:33:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1744 states have (on average 1.4180045871559632) internal successors, (2473), 1755 states have internal predecessors, (2473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2473 transitions. [2022-07-12 18:33:03,420 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2473 transitions. Word has length 41 [2022-07-12 18:33:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:03,421 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 2473 transitions. [2022-07-12 18:33:03,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2473 transitions. [2022-07-12 18:33:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 18:33:03,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:03,422 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:03,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:03,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:03,629 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:03,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:03,629 INFO L85 PathProgramCache]: Analyzing trace with hash 685518324, now seen corresponding path program 2 times [2022-07-12 18:33:03,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:03,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181057118] [2022-07-12 18:33:03,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:33:03,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:03,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:03,630 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:03,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 18:33:03,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:33:03,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:33:03,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:33:03,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:33:03,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:33:04,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:04,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181057118] [2022-07-12 18:33:04,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181057118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:04,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:04,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2022-07-12 18:33:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682738380] [2022-07-12 18:33:04,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:04,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 18:33:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:04,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 18:33:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:33:04,082 INFO L87 Difference]: Start difference. First operand 1756 states and 2473 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:04,729 INFO L93 Difference]: Finished difference Result 2042 states and 2790 transitions. [2022-07-12 18:33:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:33:04,730 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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 49 [2022-07-12 18:33:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:04,734 INFO L225 Difference]: With dead ends: 2042 [2022-07-12 18:33:04,735 INFO L226 Difference]: Without dead ends: 2042 [2022-07-12 18:33:04,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 18:33:04,735 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 860 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:04,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1970 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:33:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-12 18:33:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1982. [2022-07-12 18:33:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1970 states have (on average 1.416243654822335) internal successors, (2790), 1981 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2790 transitions. [2022-07-12 18:33:04,758 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2790 transitions. Word has length 49 [2022-07-12 18:33:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:04,758 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 2790 transitions. [2022-07-12 18:33:04,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2790 transitions. [2022-07-12 18:33:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 18:33:04,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:04,760 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:04,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:04,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:04,966 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2022-07-12 18:33:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:04,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925862850] [2022-07-12 18:33:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:04,968 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:04,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 18:33:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:05,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:33:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:05,174 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 18:33:05,174 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:33:05,175 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-07-12 18:33:05,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-07-12 18:33:05,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-07-12 18:33:05,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-07-12 18:33:05,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-07-12 18:33:05,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-07-12 18:33:05,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:05,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:05,384 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:05,386 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:33:05,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:33:05 BoogieIcfgContainer [2022-07-12 18:33:05,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:33:05,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:33:05,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:33:05,421 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:33:05,421 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:32:56" (3/4) ... [2022-07-12 18:33:05,423 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 18:33:05,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:33:05,423 INFO L158 Benchmark]: Toolchain (without parser) took 10029.24ms. Allocated memory was 56.6MB in the beginning and 100.7MB in the end (delta: 44.0MB). Free memory was 34.7MB in the beginning and 40.0MB in the end (delta: -5.3MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2022-07-12 18:33:05,423 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:05,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.36ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.5MB in the beginning and 46.2MB in the end (delta: -11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:33:05,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.28ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 44.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:05,424 INFO L158 Benchmark]: Boogie Preprocessor took 46.26ms. Allocated memory is still 69.2MB. Free memory was 44.0MB in the beginning and 42.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:05,424 INFO L158 Benchmark]: RCFGBuilder took 504.60ms. Allocated memory is still 69.2MB. Free memory was 42.3MB in the beginning and 42.7MB in the end (delta: -434.4kB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:05,425 INFO L158 Benchmark]: TraceAbstraction took 9088.24ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 42.1MB in the beginning and 40.0MB in the end (delta: 2.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2022-07-12 18:33:05,425 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 100.7MB. Free memory is still 40.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:05,426 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.36ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.5MB in the beginning and 46.2MB in the end (delta: -11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.28ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 44.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.26ms. Allocated memory is still 69.2MB. Free memory was 44.0MB in the beginning and 42.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 504.60ms. Allocated memory is still 69.2MB. Free memory was 42.3MB in the beginning and 42.7MB in the end (delta: -434.4kB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9088.24ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 42.1MB in the beginning and 40.0MB in the end (delta: 2.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 100.7MB. Free memory is still 40.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3896 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3896 mSDsluCounter, 10388 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8027 mSDsCounter, 377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1188 IncrementalHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 377 mSolverCounterUnsat, 2361 mSDtfsCounter, 1188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 494 SyntacticMatches, 11 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1982occurred in iteration=17, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 2303 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 582 ConstructedInterpolants, 0 QuantifiedInterpolants, 2417 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1510 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 200/538 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 18:33:05,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample